-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
a549f01
commit a7584d0
Showing
6 changed files
with
73 additions
and
3 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,45 @@ | ||
public class FastSort{ | ||
|
||
public static void main(String []args){ | ||
System.out.println("Hello World"); | ||
int[] a = {12,20,5,16,15,1,30,45,23,9}; | ||
int start = 0; | ||
int end = a.length-1; | ||
sort(a,start,end); | ||
for(int i = 0; i<a.length; i++){ | ||
System.out.println(a[i]); | ||
} | ||
|
||
} | ||
|
||
public void sort(int[] a,int low,int high){ | ||
int start = low; | ||
int end = high; | ||
int key = a[low]; | ||
|
||
|
||
while(end>start){ | ||
//从后往前比较 | ||
while(end>start&&a[end]>=key) //如果没有比关键值小的,比较下一个,直到有比关键值小的交换位置,然后又从前往后比较 | ||
end--; | ||
if(a[end]<=key){ | ||
int temp = a[end]; | ||
a[end] = a[start]; | ||
a[start] = temp; | ||
} | ||
//从前往后比较 | ||
while(end>start&&a[start]<=key)//如果没有比关键值大的,比较下一个,直到有比关键值大的交换位置 | ||
start++; | ||
if(a[start]>=key){ | ||
int temp = a[start]; | ||
a[start] = a[end]; | ||
a[end] = temp; | ||
} | ||
//此时第一次循环比较结束,关键值的位置已经确定了。左边的值都比关键值小,右边的值都比关键值大,但是两边的顺序还有可能是不一样的,进行下面的递归调用 | ||
} | ||
//递归 | ||
if(start>low) sort(a,low,start-1);//左边序列。第一个索引位置到关键值索引-1 | ||
if(end<high) sort(a,end+1,high);//右边序列。从关键值索引+1到最后一个 | ||
} | ||
|
||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters