排序算法

初始化数组z存放准备排序的序列
n=z.len
INI(0,n-1)

if(left<right)
{
   parti=par(left,right);
   INI(left,parti-1);
   INI(parti+1,right);
}

i=left
j=right+1
while 1
   do
   {
      j=j-1
   }while z[j]>z[left]
   do
   {
      i=i+1
   }while z[i]<z[left] and i<right
   if j>i
      SWAP(z[i],z[j])
   else
      SWAP(z[j],z[left])
      break
return j

初始化数组z存放准备排序的序列
n=z.len
INI(0,n-1)

if(left<right)
{
   mid=(left+right)/2
   INI(left,mid)
   INI(mid+1,right)
   MER(left,mid,right)
}

i=left
j=mid+1
k=right
while i!=mid+1 and j!=right+1
{
   if z[i]>z[j]
   {
      prez[k]=z[j]
      k=k+1
      j=j+1
   }else
   {
      prez[k]=z[i]
      k=k+1
      i=i+1
   }
}
while i!=mid+1
{
   prez[k]=z[i]
   k=k+1
   i=i+1
}
while j!=right+1
{
   prez[k]=z[j]
   k=k+1
   j=j+1
}
for i=left to right
   z[i]=prez[i]