| CARVIEW |
Select Language
HTTP/2 200
content-type: text/html; charset=utf-8
date: Wed, 30 Jul 2025 17:04:30 GMT
permissions-policy: interest-cohort=()
strict-transport-security: max-age=31536000; includeSubDomains
server: nginx
cache-control: s-maxage=46678, max-age=0
x-powered-by: Next.js
etag: "r1rzc8devv9yp0"
content-encoding: gzip
x-xss-protection: 1; mode=block
x-content-type-options: nosniff
referrer-policy: no-referrer-when-downgrade
content-security-policy: default-src 'self' http: https: ws: wss: data: blob: 'unsafe-eval' 'unsafe-inline'; frame-ancestors 'self';
vary: Accept-Encoding
x-cache: Hit from cloudfront
via: 1.1 8bbba1833fc985cc4235ff03e7289950.cloudfront.net (CloudFront)
x-amz-cf-pop: BOM78-P9
x-amz-cf-id: NZd_p6dmRndcngOYnxwmfGJMDRlgA0u5zijYpqLQLpD17go9-wLDvA==
age: 24226
Quiz about Top MCQs on RadixSort Algorithm with Answers 
- Courses
- Tutorials
- Practice
- Jobs
Data Structure
Java
Python
HTML
Interview Preparation
Top MCQs on RadixSort Algorithm with Answers
Last Updated :
Discuss
Comments
Question 1
If there are n integers to sort, each integer has d digits, and each digit is in the set {1, 2, ..., k}, radix sort can sort the numbers in:
- O (k (n + d))
- O (d (n + k))
- O ((n + k) lg d)
- O ((n + d) lg k)
Question 2
If there are n integers to sort, each integer has d digits and each digit is in the set {1, 2, ..., k}, radix sort can sort the numbers in :
- O(d n k)
O(d nk)
- O((d +n) k)
- O(d (n + k))
Question 3
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number):
- 45
- 72
- 360
- 450
Question 4
Given an array where numbers are in range from 1 to n6, which sorting algorithm can be used to sort these number in linear time?
- Not possible to sort in linear time
- Radix Sort
- Counting Sort
- Quick Sort
Question 5
If we use Radix Sort to sort n integers in the range (nk/2,nk], for some k>0 which is independent of n, the time taken would be?
Θ(n)
Θ(kn)
Θ(nlogn)
Θ(n2)
Tags:
There are 5 questions to complete.
Take a part in the ongoing discussion
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy