The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged radixsort
+1
vote
1
answer
1
Cormen Edition 3 Exercise 8.3 Question 4 (Page No. 200)
Show how to sort $n$ integers in the range $0$ to $n^31$ in $O(n)$ time.
asked
Jun 28
in
Algorithms
by
akash.dinkar12
Boss
(
41.9k
points)

54
views
cormen
algorithms
sorting
radixsort
descriptive
0
votes
0
answers
2
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?
asked
Jun 28
in
Algorithms
by
akash.dinkar12
Boss
(
41.9k
points)

17
views
cormen
algorithms
sorting
radixsort
descriptive
0
votes
1
answer
3
Cormen Edition 3 Exercise 8.3 Question 1 (Page No. 199)
RADIXSORT(A, d) 1 for i = 1 to d 2 use a stable sort to sort array A on digit i illustrate the operation of RADIXSORT on the following list of English words: COW, DOG, SEA, RUG, ROW, MOB, BOX, TAB, BAR, EAR, TAR, DIG, BIG, TEA, NOW, FOX.
asked
Jun 28
in
Algorithms
by
akash.dinkar12
Boss
(
41.9k
points)

25
views
cormen
algorithms
sorting
radixsort
descriptive
0
votes
1
answer
4
GateForum
Can anyone please explain
asked
Nov 4, 2018
in
Algorithms
by
nag.swarna
(
177
points)

52
views
algorithms
radixsort
+1
vote
2
answers
5
UGCNETJuly2018II28
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
asked
Jul 13, 2018
in
Others
by
Pooja Khatri
Boss
(
10.8k
points)

2.5k
views
ugcnetjuly2018ii
datastructure
radixsort
+1
vote
1
answer
6
Sorting
asked
Mar 19, 2018
in
Algorithms
by
pankaj_vir
Boss
(
10.6k
points)

164
views
testseries
sorting
algorithms
heapsort
radixsort
0
votes
1
answer
7
Radix Sort Problem
The complexity of Radix Sort is $O(wn)$, for $n$ keys which are integers of word size $w$. Here, $w=log_2(n^k)=k\times log_2(n)$ So, the complexity is $O(wn)=O(k\times log_2(n)\times n)$ For instance if size is $n^3$ the complexity ... Then why we say radix sort sorts the input in linear time? Similar Concept used to solve : https://gateoverflow.in/3353/gate2008it43
asked
Feb 19, 2018
in
Algorithms
by
Na462
Loyal
(
6.9k
points)

186
views
algorithms
radixsort
timecomplexity
sorting
0
votes
0
answers
8
Self thought
We know that radix sort's run time is $\Theta (d(n +k))$ where n is the no. of elements to be sorted, k is the range of individual digit of the elements ($k =O(n)$) and $d$ is the no. of digits in every element, which is assumed to be constant. I am ... and also $k= O(n)$ (0 to 9) We can do this with any random arrangement of numbers and achieve a linear time, Where am I wrong $?$
asked
Oct 16, 2016
in
Algorithms
by
vivek9837
Junior
(
835
points)

59
views
algorithms
radixsort
+1
vote
1
answer
9
UGCNETAUG2016III35
If there are $n$ integers to sort, each integer has d digits, and each digit is in the set $\left\{1, 2, β¦, k\right\}$, radix sort can sort the numbers in : $O (k (n + d))$ $O (d (n + k))$ $O ((n + k) l g d)$ $O ((n + d) l g k)$
asked
Oct 1, 2016
in
Others
by
makhdoom ghaya
Boss
(
30.2k
points)

263
views
ugcnetaug2016iii
datastructure
radixsort
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Follow @csegate
Recent questions tagged radixsort
Recent Blog Comments
Lakshman Patel RJIT Do you have such notes...
Great work sir
Yes Sir, It will be very helpful if we get...
@arjun sir is there a pdf...
Really helpful sir Thanks a tonππ
50,645
questions
56,553
answers
195,705
comments
101,559
users