Q229
How many comparisons will be made in the worst case when an array of size n will be sorted by using a binary insertion sort algorithm?
A.
n
B.
1
C.
log n
AnswerD.
n log n
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board