C++快速排序I

// 快速排序I.cpp : Defines the entry point for the console application.

//

#include "stdafx.h"

#include

#define N 100

using namespace std;

double a[N];

void fast_sortI(double *a,int begin,int end)

{

if(begin

{

int i =begin,j=end;

double key = a[begin];

while(i

{

while(i=key) j--;

a[i]=a[j];

while(i

a[j]=a[i];

}

a[i]=key;

fast_sortI(a,begin,i-1);

fast_sortI(a,i+1,end);

}

}

int _tmain(int argc, _TCHAR* argv[])

{

int cases;

cout<<"请输入需要排序的案例个数："<

cin>>cases;

while(cases--)

{

memset(a,0.0,sizeof(a));

int n;

cout<<"请输入需要排序的元素的个数："<

cin>>n;

cout<<"请输入需要排序的元素："<

int i = 0;

for(i=0;i

{

cin>>a[i];

}

cout<<"排序前："<

for(i=0;i

{

cout<

}

cout<

fast_sortI(a,0,n-1);

cout<<"排序后："<

for(i=0;i

{

cout<

}

cout<

}

system("pause");

return 0;

}

摘自 heyongluoyao8的专栏