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
41 lines (37 loc) · 814 Bytes

File metadata and controls

41 lines (37 loc) · 814 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
34
35
36
37
38
39
40
41
/**
*
*/
/**
* @author DELL
* Project Name: Java_learn
* Class Name: quicksort
* date: 2019年9月2日
*/
public class quicksort {
public void quick_sort(int []a, int left, int right) {
if(left > right) {
return;
}
int i = left;
int j = right;
int temp = a[left];
while(i != j) {
while(i < j && a[j] >= temp) {
j--;
}
while(i < j && a[i] <= temp) {
i++;
}
if(i < j) {
int tt = a[i];
a[i] = a[j];
a[j] = tt;
}
}
int kk = a[i];
a[i] = temp;
a[left] = kk;
quick_sort(a, left, j-1);
quick_sort(a, i+1, right);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.