Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
33 lines (28 loc) · 578 Bytes

File metadata and controls

33 lines (28 loc) · 578 Bytes
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
32
33
/**
* @author LZD 2018/02/26
*/
/*
* 选择排序
* 时间复杂度:O(N^2),额外空间复杂度:O(1)
*/
package class01;
public class selectSort {
public static void sort(int[] arr) {
if(arr == null || arr.length < 2)
return;
for(int i = 0;i < arr.length;i++) {
int minIndex = i;
for(int j = i+1;j < arr.length;j++) {
minIndex = arr[j] < arr[i] ? j : minIndex;
}
swap(arr, i, minIndex);
}
}
public static void swap(int[] arr, int a, int b) {
int tmp = arr[a];
arr[a] = arr[b];
arr[b] = tmp;
}
public static void main(String[] args) {
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.