Q339
Which of the following sorting algorithm will be preferred when the size of partition is between 16 and 2 log(n) while implementing introsort?
A.
quick sort
AnswerB.
insertion sort
C.
heap sort
D.
merge sort
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board