Suppose an array A = ( 9,4,12,2,6,8,18).
Which of the following lists of numbers would accurately show the array after the third pass through the Insertion Sort algorithm?
Isn't the answer be b) . It says that it is c on the exam.
Here option c is correct. Because insertion sort is an in place algo. Here in one pass we pick first smallest element that... View the full answer