Question

In C, what are the basic loops required to perform an insertion sort?
O A. do-while
O B. if else
O C. for and while
D. for and if​

Answer 1

Answer:

To perform an insertion sort, we use two basic loops- an outer for loop and an inner while loop. 11. Binary search can be used in an insertion sort algorithm to reduce the number of comparisons