Question

Show the execution of the selection sort algorithm on the following array. Hint: The yellow or shaded squares should be the remaining unsorted values.

Pass #	0	1	2	3	4	5	6	7
0	16	11	21	32	41	20	3	9
1
2
3
4
5
6
7

Show the execution of the insertion sort algorithm on the following array. Hint: The yellow or shaded squares should be the remaining unsorted values.

Pass #	0	1	2	3	4	5	6	7
0	16	11	21	32	41	20	3	9
1
2
3
4
5
6
7

Show the execution of the bubble sort algorithm on the following array. Hint: The yellow or shaded squares should be the remaining unsorted values.

Pass #	0	1	2	3	4	5	6	7
0	16	11	21	32	41	20	3	9
1
2
3
4
5
6
7

Answer 1

Solution:

Selection sort:

The selection sort algorithm while execution contains two subarrays from which one of the arrays is in sorted order and another one is in unsorted order.

The sorted order contains the element from the unsorted array in order of minimum to maximum.

so the smallest to largest numbers will be placed and sorted after each pass.

so the steps will be

Pass #	0	1	2	3	4	5	6	7
0	16	11	21	32	41	20	3	9
1	3	11	21	32	41	20	16	9
2	3	9	21	32	41	20	16	11
3	3	9	11	32	41	20	16	21
4	3	9	11	16	41	20	32	21
5	3	9	11	16	20	41	32	21
6	3	9	11	16	20	21	32	41
7	3	9	11	16	20	21	32	41

Now the array is sorted.

Insertion sort:

Insertion sort start to sort the subarray at each pass and the sorted array grows until all the elements are sorted

Pass #	0	1	2	3	4	5	6	7
0	16	11	21	32	41	20	3	9
1	11	16	21	32	41	20	3	9
2	11	16	21	32	41	20	3	9
3	11	16	21	32	41	20	3	9
4	11	16	21	32	41	20	3	9
5	11	16	20	21	32	41	3	9
6	3	11	16	20	21	32	41	9
7	3	9	11	16	20	21	32	41

Bubble sort:

Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order.

This way the largest element will be placed at the end of the array at each pass.

Pass #	0	1	2	3	4	5	6	7
0	16	11	21	32	41	20	3	9
1	11	16	21	32	20	3	9	41
2	11	16	21	20	3	9	32	41
3	11	16	20	3	9	21	32	41
4	11	16	3	9	20	21	32	41
5	11	3	9	16	20	21	32	41
6	3	9	11	16	20	21	32	41
7

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)