a[high]=a[low];
}
a[low]=a[0];
return low;
}
public void quitsort(int low,int high)
{
if(low
int pivotloc=partition(low,high);
quitsort(low,pivotloc-1);
quitsort(pivotloc+1,high);
}
}
public void print()
{
System.out.println("快速排序");
for(int i=1;i<11;i++)
{
System.out.print(a[i]);
System.out.print(' ');
}
System.out.print("\n");
}
}
class MergeSort
{
int[] a=new int[11];
public void init(int[] b)
{
for(int i=0;i<11;i++)
a[i]=b[i];
}
public void merge(int l,int m,int r)
{
int i,j,k;
int[] d=new int [11];
i=l;
j=m+1;
k=1;
while(i<=m&&j<=r)
{
if(a[i]<=a[j])
d[k++]=a[i++];
else
d[k++]=a[j++];
}
while(i<=m)
d[k++]=a[i++];
while(j<=r)
d[k++]=a[j++];
for(i=l,k=1;i<=r;i++,k++)
a[i]=d[k];
}
public void mergesort(int left,int right)
{
int mid;
if(left
mid=(left+right)/2;
mergesort(left,mid);
mergesort(mid+1,right);
merge(left,mid,right);
}
}
public void print()
{
System.out.println("归并排序");
for(int i=1;i<11;i++)
{
System.out.print(a[i]);
System.out.print(' ');
}
System.out.print("\n");
}
class HeapSort
{
int[] a=new int[11];
public void init(int[] b)
{
for(int i=0;i<11;i++)
a[i]=b[i];
}
//数组中除了a[s]均满足堆的定义，本函数调整a[s],使其仍为一个大顶堆
public void heapsort(int s,int m)
{
int j,rc;
rc=a[s];
for(j=2*s;j<=m;j*=2)
{
if(j
if(rc>=a[j])
break;
a[s]=a[j];
s=j;
}
a[s]=rc;
}
public void print()
{
for(int i=10/2;i>=1;i--)
heapsort(i,10);
for(int i=10;i>1;i--)
{
int temp=a[i];
a[i]=a[1];
a[1]=temp;
heapsort(1,i-1);
}
System.out.println("堆排序");
for(int i=1;i<11;i++)
{
System.out.print(a[i]);
System.out.print(' ');
}
System.out.print("\n");
}
}
public class sort {
public static void main(String args[])
{
int[] num=new int[11];
Scanner scanner=new Scanner(System.in);
for(int i=1;i<11;i++)
{
num[i]=scanner.nextInt();
}
scanner.close();
InsertSort q1=new InsertSort();
q1.init(num);
q1.insertsort();
ShellSort q2=new ShellSort();
q2.init(num);
q2.shellsort();
QuitSort q3=new QuitSort();
q3.init(num);
q3.quitsort(1,10);
q3.print();
MergeSort q4=new MergeSort();
q4.init(num);
q4.mergesort(1,10);
q4.print();
HeapSort q5=new HeapSort();
q5.init(num);
q5.print();
}
}
