Question

the following array is to be sorted biggest to smallest using insertion sort. [10, 40, 50, 30, 20, 60] what will the array look like after the third pass of the for loop?

Answer 1

After the third pass of the for loop, the array will look like this: [10, 30, 40, 50, 20, 60].

Step-by-step explanation:

Insertion sort works by dividing the array into two parts: a sorted part and an unsorted part. The algorithm iterates through the unsorted part and for each element, it compares it with the elements in the sorted part and inserts it in the correct position such that the sorted part remains sorted.

In this case, the array [10, 40, 50, 30, 20, 60] needs to be sorted in decreasing order. After the first pass, the first element (10) will be in its correct position in the sorted part and the unsorted part will contain the rest of the elements [40, 50, 30, 20, 60].

After the second pass, the second element (40) will be inserted in the correct position in the sorted part, which will now be [10, 40], and the unsorted part will contain the rest of the elements [50, 30, 20, 60].

After the third pass, the third element (50) will be inserted in the correct position in the sorted part, which will now be [10, 30, 40], and the unsorted part will contain the rest of the elements [20, 60].

So, after the third pass, the array will look like this [10, 30, 40, 50, 20, 60].