In insertion sort, the average number of comparisons required to place – McqOptions

MCQOPTIONS

1.	In insertion sort, the average number of comparisons required to place the 7th element into its correct position is ____
A.	9
B.	4
C.	7
D.	14
Answer» C.

Discussion

No Comment Found

Related MCQs

In insertion sort, the average number of comparisons required to place the 7th element into its correct position is ____
Statement 1: In insertion sort, after m passes through the array, the first m elements are in sorted order.
The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?

Related Topics

1

2

Recent Visits