Question

An array contains the following characters in the sequence below:

K

N

M

O

B

Write down the characters for each round according to the specified sorting algorithms which sorts the character array into its ascending order.

First round always begins at the first location of the array.

• Bubble Sort

Round 1:
Round 2:
Round 3:
Round 4:
Round 5:

• Selection Sort

Round 1:
Round 2:
Round 3:
Round 4:
Round 5:

• Insertion Sort

Round 1:
Round 2:
Round 3:
Round 4:
Round 5:

Answer 1

Thanks for asking!

1.Bubble Sort

Original Array: K N M O B

Adjacent elements will be swapped , starting from 1st to last element (say n i.e. size of array).

Round 1: K M N B O

Again adjacent elements will be swapped but only till n-1 element because last element is in its perfect place.

Round 2: K M B N O

Now, from first to (n-2)th element.

Round 3: K B M N O

Round 4: B K M N O

Round 5: B K M N O

2. Selection Sort

This sorting algorithm finds the smallest element and replace it with the first, then again finds the smallest element in the arrat except the first element, and replaces it with second element and so on.

Original Array: K N M O B

B is the smallest element, replaced by first element.

Round 1: B N M O K

Now from N to K, smallest element is K

Round 2: B K M O N

Now from M to N, smallest element is M. Already in its correct place

Round 3: B K M O N

Now from O to N, smallest element is N.

Round 4: B K M N O

Round 5: B K M N O

3. Insertion Sort

In this algorithm, each element (starting from 2nd element to last element) is compared to the elements present before it, and keep swapping if the previous element is larger than present element .

Original Array: K N M O B

Starting from N, comparing it with K. As K is less than N, No Swapping takes place

Round 1: K N M O B

Now, comparing M with N and K, it is swapped with N as it is less than M.

Round 2: K M N O B

Now, comparing O with its previous elements, it is already larger than all its previous.

Round 3: K M N O B

Now, comparing B with its previous elements, as it is smaller than O, N , M , K, it is swapped with all of them one by one.

Round 4: B K M N O

Sorted!

Round 5: B K M N O

I hope you like it!