Several sorting algorithms learned by Xiaobai, record them for review
1. Select Sort
public static void XuanZhe() {
int min,i;
for(i=0;i<a.length-1;i++)
{
min=i;
for(int j=i+1;j<a.length;j++)
if(a[min]>a[j])
min=j;
int temp = a[i];
a[i] = a[min];
a[min] =temp;
}
}
2. Bubble sort
public static void MaoPao() {
for(int i=0;i<a.length-1;i++)
for(int j=0;j<a.length-i-1;j++)
if(a[j]<a[j+1])
{
int temp = a[j];
a[j] = a[j+1];
a[j+1] =temp;
}
}
3. Quick sort
public static void qsort(int l,int r) {
if(l>r)return;
int i = l;
int j = r;
int mid=(l+r)/2;
int tmp = a[mid];
a[mid]=a[i];
while(i<j) {
while(i<j && a[j]>=tmp)j--;
a[i]=a[j];
while(i<j && a[i]<=tmp)i++;
a[j]=a[i];
}
a[i]=tmp;
qsort(l,i-1);
qsort(i+1,r);
}