Which of the following is an advantage of binary insertion sort over its standard version?
(a) it has better time complexity
(b) it has better space complexity
(c) it makes less number of comparisons
(d) it has no significant advantage
I got this question in examination.
This key question is from Sorting in division Sorting of Data Structures & Algorithms II