FilesExpand file tree

 master

/

th3_SelectSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

31 lines (29 loc) · 839 Bytes

 master

/

th3_SelectSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

31 lines (29 loc) · 839 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

package Chapter1_Sort;

import java.util.Arrays;

// 从[i,n]选一个最小的放在第i个位置，然后找[i-1,n]

// 可能越过相等的值，导致不稳定

public class th3_SelectSort {

public static void main(String[] args) {

int[] arr = new int[]{

5,1,34,8,1,64,9,7,6

};

selectSort(arr);

System.out.println(Arrays.toString(arr));

}

public static void selectSort(int[] arr){

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

int min = i;

for (int j=i; j<arr.length; j++){

if (arr[j]<arr[min]){

min = j;

}

}

swap(arr, i, min);

}

}

public static void swap(int[] arr, int i, int j){

int temp = arr[i];

arr[i] = arr[j];

arr[j] = temp;

}

}