排序算法

//快速排序

private static void Quick(int[] a,int low,int high) {

if(low<high)
{
int position=Partition(a,low, high);
Quick(a,low,position-1);
Quick(a,position+1,high);
}
}


private static int Partition(int[] a, int low, int high) {
int i=low-1;
int m=a[high];
for(int j=low;j<=high-1;j++){
if(a[j]<=m){
i++;
int t=a[i];
a[i]=a[j];
a[j]=t;
}
}
int temp=a[i+1];
a[i+1]=a[high];
a[high]=temp;
return i+1;

}

=========================================================================

//堆排序的建堆过程

private static void BulidHeap(int[] a, int len) {
for(int i=len/2;i>=1;i--){
AdjustDown(a,i,len);
}
}


private static void AdjustDown(int[] a, int i, int len) {
if(i*2<=len){
if(i*2+1<=len){
int max=a[i*2-1]>a[i*2]?a[i*2-1]:a[i*2];
if(a[i-1]<max)
{
if(max==a[i*2-1])
{
int t=a[i-1];
a[i-1]=a[i*2-1];
a[i*2-1]=t;
AdjustDown( a,  i*2, len);
}
else{
int t=a[i-1];
a[i-1]=a[i*2];
a[i*2]=t;
AdjustDown( a,  i*2+1, len);
}


}


}
else{
if(a[i-1]<a[i*2-1]){
int t=a[i-1];
a[i-1]=a[i*2-1];
a[i*2-1]=t;
AdjustDown( a,  i*2, len);
}
}
}
}

====================================================

二路归并

private static void MergeSort(int[] a, int low, int high) {
if(low<high){
int mid=(low+high)/2;
MergeSort(a,low,mid);
MergeSort(a,mid+1,high);
Merge(a,low ,mid,high);
}
}


private static void Merge(int[] a, int low, int mid, int high) {
int[] arr=new int[high-low+1];
for(int i=low,j=0;i<=high;i++){
arr[j]=a[i];
j++;
}
int i=0;
int j=mid-low+1;
int z=low;
while(i<=mid-low && j<=high-low){
if(arr[i]<arr[j]){
a[z]=arr[i];
i++;
}
else{
a[z]=arr[j];
j++;
}
z++;
}

if(i>mid-low){
while(j<=high-low){
a[z]=arr[j];
j++;
z++;
}
}
else{
while(i<=mid-low){
a[z]=arr[i];
i++;
z++;
}
}
}