选择，冒泡，快排

闲来无事，复习了下选择排序，冒泡排序，快速排序，与大家共享

//冒泡-----这是有问题的冒泡排序，汗，提醒自己

int main()
{
int a[N];
int i,j,t;
cout<<"input the number will be sort:"<<endl;
for(i=0;i<N;i++)
cin>>a[i];


for(i=0;i<N-1;i++)
for(j=0;j<N-1;j++)
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
cout<<"sorted:"<<endl;
for(i=0;i<N;i++)
cout<<a[i]<<" ";
cout<<endl;
system("pause");
return 0;
}

//选择排序

int main()
{
int a[N];
int i,j,t;
cout<<"input the number will be sort:"<<endl;
for(i=0;i<N;i++)
cin>>a[i];
for(i=0;i<N-1;i++)
for(j=i+1;j<N;j++)
if(a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
for(i=0;i<N;i++)
cout<<a[i]<<" ";
cout<<endl;
system("pause");
return 0;
}

//快排

void quicksort(int a[],int low,int high)
{
int mid;
if(low<high)
{
mid=partition(a,low,high);
quicksort(a,low,mid-1);
quicksort(a,mid+1,high);
}
}
int partition(int a[],int low,int high)
{
int temp=a[low];
while(low<high)
{
while((low<high)&&(a[high]>temp))
high--;
if(low<high)
a[low++]=a[high];
while((low<high)&&(a[low]<temp))
low++;
if(low<high)
a[high--]=a[low];
}
a[low]=temp;
return low;
}
int main()
{
int a[N];
int i;
for(i=0;i<N;i++)
cin>>a[i];
quicksort(a,0,N-1);
for(i=0;i<N;i++)
cout<<a[i]<<" ";
cout<<endl;
system("pause");
return 0;
}