Question

Show how insertion sort would work

Z I M B A B W E

Answer 1

`Hey,

Note: Brother in case of any queries, just comment in box I would be very happy to assist all your queries

Algorithm
// Sort an arr[] of size n
insertionSort(arr, n)
Loop from i = 1 to n-1.
……a) Pick element arr[i] and insert it into sorted sequence arr[0…i-1]

So, for Z I M B A W E

Since Z>i So, swap

I Z M B A W E

Since M>I So, No swap

Since I>B So, swap

B Z M I A W E

Since B>A So, swap

A Z M I B W E

Since W>A So, No swap

Since E>A So, No swap

Since Z>M So, swap

A M Z I B W E

Since M>I So, swap

A I Z M B W E

Since I>B So, swap

A B Z M I W E

Since W>B So, No swap

Since E>B So, No swap

Since Z>M So, swap

A B M Z I W E

Since M>I So, swap

A B I Z M W E

Since W>I So, No swap

Since I>E So, swap

A B E Z M W I

Since Z>M So, swap

A B E M Z W I

Since W>M So, No swap

Since M>I So, swap

A B E I Z W M

Since Z>W So, swap

A B E I W Z M

Since W>M So, swap

A B E I M Z W

Since Z>W So, swap

A B E I M W Z

Kindly revert for any queries

Thanks.