Selection sort

1. Selection Sort
Hup university
21-1-2018

2. Start

3. SelectionSort.java
 public class selectionSort{
 public static void selectionSort(double[] list){
 for (int i=list.length-1;i>=1;i--){
 double Max =list[0]; int Index =0;
 for (int j=1; j<= i; j++){
 if (Max <list[j]){ Max =list[j];index=j;}
 }
 if (index != i){list[index]=list[i];list[i]=Max;}
 }
 }
 }

4. Find the Max in the list[0..5]
Max= 15

5. if Max < Last[5] then swap
15<10 ? swap

6. Search for Max in list [0..4]

7. Find the max in the list[0..4]
Max=10

8. if Max < Last[4] then swap
10 < 8 ? swap

9. Search for Max in list [0..3]

10. Find the Max in the list[0..3]
Max=9

11. Search for Max in list [0..2]

12. Find the Max in the list[0..2]
Max=8

13. if Max < Last[2] then swap
8 < 4 ? swap

14. Search for Max in list [0..1]

15. Find the Max in the list[0..1]
Max=5

16. if Max < Last[1] then swap
5 <4 ? swap

17. End