7-2.txt

数据结构上机实验内容. 快速排序源程序代码

快速排序源程序代码
#include<iostream.h>
#define N 10
void main()
{
void qsort(int r1[N],int a,int b);
  int  r[N],result[N];
  int i,j;
	cout<<"Please input Howmany numbers do you want to cin"<<endl;
	cout<<"i=";
	cin>>i;
     if( i>N){ cout<<"over float,Make sure i<"<<N<<endl;
	      cin>>i;}
	      else cout<<"Right"<<endl;
	cout<<endl;
     for(j=1;j<=i;j++)
	cin>>r[j];
     qsort(r,1,i);
	  for(j=1;j<=i;j++)
	     cout<<r[j]<<" ";
	     cout<<endl;
}
void  qsort(int r[N],int a,int b)
 {
   int s=a,t=b;
   int temp;
   int i,j;
   do
     {
	for(i=1;i<=t;i++)
	  for(j=i+1;j<=t;j++)
	 {
	  if( r[i]>r[j])  {
			 temp=r[i];
			 r[i]=r[j];
			 r[j]=temp;
			 }
	 }
	for(i=1;i<=t;i++)
	  for(j=i+1;j<=t;j++)
	  if( r[i]>r[j] ) {
			temp=r[i];
			r[i]=r[j];
			r[j]=temp;
			  }
     }
	while(s==t);

 }