Dark Mode

Recent questions tagged radix-sort

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

Ramayya asked in DS Jan 7

443 views

1 vote

1 answer

2

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

gatecse asked in Algorithms Dec 9, 2020

629 views

1 vote

2 answers

3

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.

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

1.1k views

0 votes

0 answers

4

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?

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

586 views

0 votes

1 answer

5

Cormen Edition 3 Exercise 8.3 Question 1 (Page No. 199)
RADIX-SORT(A, d) 1 for i = 1 to d 2 use a stable sort to sort array A on digit i illustrate the operation of RADIX-SORT on the following list of English words: COW, DOG, SEA, RUG, ROW, MOB, BOX, TAB, BAR, EAR, TAR, DIG, BIG, TEA, NOW, FOX.

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

1.3k views

1 vote

1 answer

6

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 ____________

Applied Course asked in Algorithms Jan 16, 2019

by Applied Course

509 views

0 votes

1 answer

7

GateForum
Can anyone please explain

nag.swarna asked in Algorithms Nov 4, 2018

569 views

3 votes

1 answer

8

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)

Sandy Sharma asked in Programming in C Sep 26, 2018

by Sandy Sharma

3.2k views

2 votes

3 answers

9

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

Pooja Khatri asked in DS Jul 13, 2018

by Pooja Khatri

17.1k views

1 vote

2 answers

10

Pradeep Verma asked in Algorithms Jul 7, 2018

by Pradeep Verma

506 views

2 votes

1 answer

11

pankaj_vir asked in Algorithms Mar 19, 2018

1.5k views

0 votes

3 answers

12

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/gate2008-it-43

Na462 asked in Algorithms Feb 19, 2018

by Na462

1.0k views

3 votes

3 answers

13

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 :)

sunil sarode asked in Algorithms Jan 23, 2018

by sunil sarode

2.9k views

3 votes

1 answer

14

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 .

hem chandra joshi asked in Algorithms Nov 25, 2017

by hem chandra joshi

318 views

0 votes

1 answer

15

cormen
why does radix sort uses stable sort i.e counting sort as an intermediate sorting algorithm?

shebya nautiyal asked in Algorithms Apr 7, 2017

by shebya nautiyal

436 views

1 vote

1 answer

16

VS asked in Algorithms Apr 2, 2017

by VS

232 views

2 votes

1 answer

17

Test by Bikram | Mock GATE | Test 1 | Question: 38
A radix sort is to be used to sort the file of non-negative integers shown below into ascending order. What would the order of the numbers be after one pass of the algorithm? $12$ $37$ $42$ $9$ $5$ $7$ $50$ $40$ $45$ $92$ $12$ $37$ $42$ $40$ $45$ $5$ $50$ $7$ ... $12$ $42$ $92$ $5$ $45$ $37$ $7$ $9$ $40$ $50$ $12$ $42$ $92$ $5$ $45$ $7$ $37$ $9$

Bikram asked in GATE Jan 16, 2017

by Bikram

495 views

3 votes

1 answer

18

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?

Rohan Mundhey asked in Algorithms Nov 9, 2016

by Rohan Mundhey

4.3k views

0 votes

0 answers

19

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 $?$

vivek9837 asked in Algorithms Oct 16, 2016

308 views

1 vote

1 answer

20

UGC NET CSE | August 2016 | Part 3 | Question: 35
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)$

makhdoom ghaya asked in DS Oct 1, 2016

by makhdoom ghaya

720 views

To see more, click for the full list of questions or popular tags.

Recent questions tagged radix-sort