Vidyalelo
Data Structure · Q307

Sorting Algorithms

Programming · Data Structure · question 307

Q307

Which of the following sorting techniques is most efficient if the range of input data is not significantly greater than a number of elements to be sorted?

A.
selection sort
B.
bubble sort
C.
counting sort
Answer
D.
insertion sort

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board