kuaisufa2.cpp

数据结构算法VC++实现

//快速排序法(类方法)kuaisufa2.cpp
#include<iostream.h>
#include<iomanip.h>
#include<stdlib.h>
#include<time.h>
#define N 10
class kuaisu
{public:
  kuaisu(float a[],int m):n(m)
   {for(int i=0;i<n;i++) b[i]=a[i];}
  void quicksort(int s,int t)
  {int i;
   if(s<t) {
    i=part(s,t);
    quicksort(s,i-1);
    quicksort(i+1,t);}
   else return;}
  int part(int s,int t)
  {int i,j;float p;
   i=s;j=t;p=b[s];
   while(i<j)
   {while(i<j&&b[j]>=p) j--;
     b[i]=b[j];
     while(i<j&&b[i]<=p) i++;
     b[j]=b[i];}
    b[i]=p;
    output();
    return i;}
  void output()
   {for(int i=0;i<n;i++)
    cout<<setprecision(2)<<setw(7)<<b[i];
    cout<<endl;}
 private:
  float b[N];int n;
};
void main()
{cout<<"kuaisufa2.cpp运行结果:\n";
 float a1[N];int i,n=N,low=0,high=9;
 srand(time(0));
 for(i=0;i<n;i++)
  a1[i]=rand()/200.0;
 kuaisu px(a1,n);
 cout<<"排序前数组:\n";
 cout<<setiosflags(ios::fixed);
 px.output();
 cout<<"数组排序的过程演示:\n";
 px.quicksort(low,high);
 cout<<"排序后数组:\n";
 px.output();cin.get();}