-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsort_1.java
More file actions
55 lines (50 loc) · 1.43 KB
/
sort_1.java
File metadata and controls
55 lines (50 loc) · 1.43 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
/**
*
*/
import java.util.Arrays;
/**
* @author DELL
* Project Name: Java_learn
* Class Name: sort_1
* date: 2019年9月10日
*/
public class sort_1 {
public static void main(String[] args) {
int[] lyst = {23, 46, 0, 8, 11, 18};
System.out.println("before sorted: ");
for (int i = 0; i < lyst.length; i++) {
System.out.print(lyst[i] + " ");
}
// 归并排序包
// Arrays.parallelSort(lyst);
System.out.println();
// 自定义快速排序
sortQuick(lyst, 0, lyst.length - 1);
System.out.println("After sorted: ");
for (int i = 0; i < lyst.length; i++) {
System.out.print(lyst[i] + " ");
}
}
public static void sortQuick(int[] ll, int left, int right) {
if (left < right) {
int index_ = get_index(ll, left, right);
sortQuick(ll, left, index_ - 1);
sortQuick(ll, index_ + 1, right);
}
}
public static int get_index(int[] ll, int left, int right) {
int temp = ll[left];
while (left < right) {
while(left < right && ll[right] >= temp) {
right--;
}
ll[left] = ll[right];
while(left < right && ll[left] <= temp) {
left++;
}
ll[right] = ll[left];
}
ll[left] = temp;
return left;
}
}