快速排序 冒泡排序

 

#include<iostream.h>
int a[]={55,85,79,21,45,86,4,6,34,74,5,47,12,89,31,39,75,82,43,156};
int a2[]={55,85,79,21,45,86,4,6,34,74,5,47,12,89,31,39,75,82,43,156};
int len=sizeof(a)/sizeof(int);
void qsort(int a[],int left,int right)
{
       int mid,l,r,temp;
       l=left;
       r=right;
       mid=a[(left+right)/2];
       while(l<r)
       {
              while(a[l]<mid)
       ++l;
       while(a[r]>mid)
       --r;
       if(l>=r)break;
       temp=a[l];
       a[l]=a[r];
       a[r]=temp;
       if(l!=mid)- -r;
       if(r!=mid)+ +l;
       }
       if(l==r)l++;
       if(left<r)
              qsort(a,left,l-1);
       if(l<right)
              qsort(a,r+1,right);
}
void bubble(int a[],int size)
{
int i,temp;
for(int p=1;p<size;p++)
{temp=0;
for(i=0;i<size-p;i++)
if(a[i]>a[i+1])
{
temp=a[i];
a[i]=a[i+1];
a[i+1]=temp;
}
if(temp==0) break;
for(i=0;i<size;i++)
cout<<a[i]<<",";
cout<<endl;}
}
int* exchange(int*array,int index,int k) //array为数组名 index为数组元素个数 k为兑换标识
{
       int*changearray=new int[index];
       int Index=0,change=k+1;
       while(change<index)
              changearray[Index++]=array[change++];
       change=0;
       while(change<=k)
              changearray[Index++]=array[change++];
       return changearray;
}
void merge(int*array,int index)
{
       int max=0;
       int min=10000;      //假设array数组中至少有一个元素比10000小
       for(int i=0;i<index;i++)
       {
              if(array[i]<min)
                     min=array[i];
              if(array[i]>max)
                     max=array[i];
       }
       cout<<"数组的最大值是:"<<max<<endl;
    cout<<"数组的最小值是:"<<min<<endl;           
}
void main()
{
    cout<<"*******原数组是:*******"<<endl;
       for(int i=0;i<len;i++)
              cout<<a[i]<<",";
       cout<<endl;
cout<<"*****快速排序结果为*****"<<endl;
       qsort(a,0,len-1);
       for(int j=0;j<len;j++)
              cout<<a[j]<<",";
       cout<<endl;
        cout<<"*****冒泡排序结果为*****"<<endl;
       bubble(a2,len);
          cout<<"*****输入数组要兑换的位置点:*******"<<endl;
          int k=0;
          cin>>k;
       int*a1=exchange(a,20,k);
          for(int m=0;m<20;m++)
                 cout<<a1[m]<<", ";
          cout<<endl;
          cout<<"********求数组的最大值和最小值********"<<endl;
       merge(a,20);
}