Question

2. Show the steps when sorting (smallest to largest) the following arrays of numbers using selection sort i.e. every time a swap occurs, show what the current state of the array looks like, including the final sorted array. -12 points a. [10,2,5,8,9,1,4,7) b. 17,1,3,2,5, 4, 8, 12, 9) c. 18,7,6,5, 4, 3, 2, 1) d. 15,3, 8, 1, 9, 4, 2, 6) I

Answer 1

a.)

1 2 5 8 9 10 4 7
1 2 5 8 9 10 4 7
1 2 4 8 9 10 5 7
1 2 4 5 9 10 8 7
1 2 4 5 7 10 8 9
1 2 4 5 7 8 10 9
1 2 4 5 7 8 9 10
Sorted array:
1 2 4 5 7 8 9 10

b.)

1 7 3 2 5 4 8 12 9
1 2 3 7 5 4 8 12 9
1 2 3 7 5 4 8 12 9
1 2 3 4 5 7 8 12 9
1 2 3 4 5 7 8 12 9
1 2 3 4 5 7 8 12 9
1 2 3 4 5 7 8 12 9
1 2 3 4 5 7 8 9 12
Sorted array:
1 2 3 4 5 7 8 9 12

c.)

1 7 6 5 4 3 2 8
1 2 6 5 4 3 7 8
1 2 3 5 4 6 7 8
1 2 3 4 5 6 7 8
1 2 3 4 5 6 7 8
1 2 3 4 5 6 7 8
1 2 3 4 5 6 7 8
Sorted array:
1 2 3 4 5 6 7 8

d.)

1 3 8 5 9 4 2 6
1 2 8 5 9 4 3 6
1 2 3 5 9 4 8 6
1 2 3 4 9 5 8 6
1 2 3 4 5 9 8 6
1 2 3 4 5 6 8 9
1 2 3 4 5 6 8 9
Sorted array:
1 2 3 4 5 6 8 9

Answer 2

An integer array contains [ 2, 4, 1, 5, 7]. Show the steps of Selection Sort algorithm to sort this array from lowest to highest.