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?
(c) log n
(d) n log n
This question was addressed to me in an interview for job.
My question is based upon Sorting in section Sorting of Data Structures & Algorithms II