Repository navigation
Expand file tree
/
Copy pathSortUtils.java
More file actions
58 lines (54 loc) · 1.48 KB
/
Copy pathSortUtils.java
File metadata and controls
58 lines (54 loc) · 1.48 KB
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
package Sort;
import java.util.Arrays;
public class SortUtils {
public static void main(String[] args) {
int[] arr = bubbleSort(new int[]{3, 1, 2, 3, 5, 0, 8});
int[] arr2 = choiceSort(new int[]{3, 1, 2, 3, 5, 0, 8});
// Arrays.stream(arr).forEach(System.out::println);
Arrays.stream(arr2).forEach(System.out::println);
}
/**
* 冒泡排序
* @param arr
* @return
*/
public static int[] bubbleSort(int[] arr){
int count = 0;
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length; j++) {
if(arr[i] < arr[j]){
int tmp = arr[j];
arr[j] = arr[i];
arr[i] = tmp;
}
count++;
}
}
System.out.println("count = " + count);
return arr;
}
/**
* 选择排序
* @param arr
* @return
*/
public static int[] choiceSort(int[] arr){
int count = 0;
for (int i = 0; i < arr.length; i++) {
int min = arr[i];
int index = i;
for (int j = i + 1; j < arr.length; j++) {
if(arr[j] < min){
min = arr[j];
index = j;
}
count++;
}
int tmp = arr[i];
arr[i] = min;
arr[index] = tmp;
}
System.out.println("count = " + count);
return arr;
}
}