Show all the steps used by the binary insertion sort to son the list 3, 2, 4, 5, 1, 6.

Step1

Given that

List 3, 2, 4, 5, 1, 6.

Step2

To find

Give all the steps which is used by the binary insertion sort to sort the list 3, 2, 4, 5, 1, 6.

Step3

Binary insertion sort is a variation of Insertion sorting in which appropriate location to insert the selected element is found using the binary search.

3, 2, 4, 5, 1, 6

In the given list compare first two element means compare 3,2

3>2

So,

2,3, 4, 5, 1, 6

Again compare third element with first two element means compare 4 with 2,3

4>2...