In insertion sort, the average number of comparisons required to place the 7^th element into its correct position is ____
(a) 9
(b) 4
(c) 7
(d) 14
This question was addressed to me in an online quiz.
This key question is from Insertion sort in portion Sorting of Data Structures & Algorithms II