Sunject: Java programing

Selection sort example (Bold text is sorted array and Italic is unsorted Array)

Find the smallest one (i.e., 2) through the unsorted Array

Interchange the smallest one with the front element of the unsorted part of the Array

(i.e., 2 is part of sorted Array and all other elements are in unsorted Array)

Keep repeating the same steps while running through the unsorted part of Array

9

4

3

8

7

2

5

9

4

3

8

7

2

5

2

4

3

8

7

9

2

3

4

5

7

9

8

2

3

4

5

7

9

8

2

3

4

5

7

8

9

Implement Selection sort (show step by step)

7

2

3

6

5

1

4

Complete the missing code in the Selection sort for the example (attach the screenshot of the output)

public static void selectionSorting(int[] myArray) {

for (int i = 0; i < myArray.length; i++) {

// going through the unsorted Array, find the smallest one.

------------------------------------------

}

}

// interchange the smallest element with the front of the unsorted part of the Array ------------------------

------------------------

-----------------------------------

} }