Operating-Systems
October 27, 2023Sorting
October 27, 2023Sorting
|
Question 117
|
Which sort uses features of the key to operate in Linear time relative to the number
of elements in the array?
of elements in the array?
|
Quick Sort
|
|
|
Merge Sort
|
|
|
Radix Sort
|
|
|
Bubble Sort
|
Question 117 Explanation:
Examples of sorting algorithms that run in linear time are counting sort, radix sort and bucket sort. Counting sort and radix sort assume that the input consists of integers in a small range.
Correct Answer: C
Question 117 Explanation:
Examples of sorting algorithms that run in linear time are counting sort, radix sort and bucket sort. Counting sort and radix sort assume that the input consists of integers in a small range.
Subscribe
Login
0 Comments