charufa1.cpp

冒泡法,快速排序等排序的实现

#include"iostream.h"
#include"paixu.h"

void isort(int a[],int size)
{int inserter,index;
for(int i=1;i<size;i++)
{   inserter=a[i];
   index=i-1;
   while(index>0&&inserter<a[index])//把前i个数看作整体后面的数往里插从后向前比
   {a[index+1]=a[index];
   index--;
   }
 a[index+1]=inserter;
 for(int j=0;j<size;j++)
 { 
   cout<<a[j]<<",";
   if(j==i)cout<<'|';
 }
cout<<endl;
}
}