Register

GateForum

• retagged by
575 views
0 votes
0 votes

Can anyone please explain

• retagged by
User Avatar

1 Answer

1 votes
1 votes

in radix sort we use a stable sorting algo and sort it from least significant digit to most significant digit.

since it has has asked about first pass ,only oth place(LSD) will be considered

IF DIGIT MATCHES THEN RELATIVE ORDERING IS CONSIDERED

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
pankaj_vir asked Mar 19, 2018
1,529 views
Sorting
User Avatar
1 votes
1 votes
2 answers
2
Pradeep Verma asked Jul 7, 2018
508 views
Radix sort
User Avatar
1 votes
1 votes
1 answer
3
gatecse asked Dec 9, 2020
641 views
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
1 votes
1 votes
2 answers
4
akash.dinkar12 asked Jun 28, 2019
1,103 views
Cormen Edition 3 Exercise 8.3 Question 4 (Page No. 200)
Show how to sort $n$ integers in the range $0$ to $n^3-1$ in $O(n)$ time.
Show how to sort $n$ integers in the range $0$ to $n^3-1$ in $O(n)$ time.
User Avatar
Link Copied!