Q483
How many swaps will be required in the worst case to sort an array having n elements using binary insertion sort?
A.
n
B.
1
C.
n * log n
D.
log n
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board