This question was previously asked in

NIELIT Scientific Assistant A Official Paper 2020

- Impossible to sort in linear time
- Radix Sort
- Insertion Sort
- Bubble Sort

Option 2 : Radix Sort

Free

Probability and Statistics

2161

20 Questions
20 Marks
30 Mins

**Concept:**

Radix sort is an integer sorting algorithm that sorts data with integer keys by grouping the keys by individual digits that share the same significant position and value (place value). Radix sort uses counting sort as a subroutine to sort an array of numbers. Because integers can be used to represent strings (by hashing the strings to integers), radix sort works on data types other than just integers. Because radix sort is not comparison-based, it is not bounded by Ω(nlogn) for running time.

**Explanation:**

Radix sort can perform in linear time because the range is known and it is within the integer.

Create an array of size (876543 - 123456)

Count the frequency and print it

India’s **#1 Learning** Platform

Start Complete Exam Preparation

Daily Live MasterClasses

Practice Question Bank

Mock Tests & Quizzes

Trusted by 2,17,07,824+ Students

Testbook Edu Solutions Pvt. Ltd.

1st & 2nd Floor, Zion Building,

Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

[email protected]
Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

Toll Free:1800 833 0800

Office Hours: 10 AM to 7 PM (all 7 days)