Register

Search results for radix

0 votes
2 answers
1
ISRO 2024
What is the maximum number of comparisons needed to sort 6 items using radix sort, if each number is a 3-digit decimal number? 120 180 210 360
What is the maximum number of comparisons needed to sort 6 items using radix sort, if each number is a 3-digit decimal number?120180210360
User Avatar
2 votes
3 answers
2
UGC NET CSE | July 2018 | Part 2 | Question: 28
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
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number):4572360450
User Avatar
3 votes
3 answers
3
number of comparison require in RADIX sort
I am not able to get this formula (number of input * number of digit *base of number ) I am not getting how base of number is important ? Thanks :)
I am not able to get this formula (number of input * number of digit *base of number )I am not getting how base of number is important ?Thanks :)
User Avatar
1 votes
1 answer
5
NIELIT Scientific Assistant A 2020 November: 103
Consider an array of positive integers between $123456$ to $876543$, which sorting algorithm can be used to sort these number in linear time? Impossible to sort in linear time Radix Sort Insertion Sort Bubble Sort
Consider an array of positive integers between $123456$ to $876543$, which sorting algorithm can be used to sort these number in linear time?Impossible to sort in linear ...
User Avatar
0 votes
0 answers
8
Cormen Edition 3 Exercise 8.3 Question 3 (Page No. 200)
Use induction to prove that radix sort works. Where does your proof need the assumption that the intermediate sort is stable?
Use induction to prove that radix sort works. Where does your proof need the assumption that the intermediate sort is stable?
User Avatar
3 votes
1 answer
9
GB DSA-Test 4-Question 17
If Radix sort is used to sort an array of n integers which are in the range , where d is some function of input size, the time taken would be? (A) (B) (C) (D)
If Radix sort is used to sort an array of n integers which are in the range ,where d is some function of input size, the time taken would be?(A) (B)(C) (D)
User Avatar
1 votes
1 answer
10
Applied Course | Mock GATE | Test 1 | Question: 55
Suppose a radix sort was done on the following set of numbers, in binary i.e,$[11, 10, 3, 14, 12, 2, 8, 15, 2]$. How many passes of counting sort would be performed ____________
Suppose a radix sort was done on the following set of numbers, in binary i.e,$[11, 10, 3, 14, 12, 2, 8, 15, 2]$. How many passes of counting sort would be performed _____...
User Avatar
0 votes
1 answer
11
GateForum
Can anyone please explain
Can anyone please explain
User Avatar
1 votes
2 answers
12
Radix sort
User Avatar
3 votes
1 answer
13
Previous Year Gate Question Doubt
From CLRS the complexity of radix sort is theta(d(n+k)) where d is # of digits , k is range and n is numbers . So how option C is right . Plz solve it on the basis of mine given complexity .
From CLRS the complexity of radix sort is theta(d(n+k)) where d is # of digits , k is range and n is numbers . So how option C is right . Plz solve it on the basis of min...
User Avatar
2 votes
1 answer
14
Sorting
User Avatar
3 votes
1 answer
16
RADIX SORT
Consider an array of n integers ranges from 0, 1, ..., n5-1. What is the time complexity of RADIX-SORT when using base-10 representation?
Consider an array of n integers ranges from 0, 1, ..., n5-1. What is the time complexity of RADIX-SORT when using base-10 representation?
User Avatar
0 votes
1 answer
18
cormen
why does radix sort uses stable sort i.e counting sort as an intermediate sorting algorithm?
why does radix sort uses stable sort i.e counting sort as an intermediate sorting algorithm?
User Avatar
1 votes
1 answer
19
cil-2017
User Avatar
To see more, click for the full list of questions or popular tags.