65,187
社区成员




#include<iostream>
using namespace std;
typedef struct
{
int length;
int data[100];
}seq;
//快速排序
int Partition(seq a,int low,int high)
{
int pivotkey;
pivotkey=a.data[low];
while(low<high)
{while(low<high&&a.data[high]>=pivotkey)
--high;
a.data[low]=a.data[high];
while(low<high&&a.data[low]<=pivotkey)
++low;
a.data[high]=a.data[low];
}
a.data[low]=pivotkey;
cout<<"比较完一次的顺序表为:";
print(a);
return low;
}
void QSort(seq a,int low,int high)
{
int pivotloc;
if(low<high)
{
pivotloc=Partition(a,low,high);
QSort(a,low,pivotloc-1);
QSort(a,pivotloc+1,high);
}
}
void QuickSort(seq a)
{
QSort(a,0,a.length-1);
}
int main()
{
seq a;
int n,k;
cout<<"请输入顺序表中元素的个数:"<<endl;
cin>>n;
a.length=n;
cout<<"请输入每个元素的值:";
for(int i=0;i<a.length;i++)
cin>>a.data[i];
cout<<"请选择排序方法:1.冒泡排序 2.直接插入排序 3.选择排序 4.快速排序"<<endl;
cin>>k;
cout<<"快速排序:"<<endl;
QuickSort(a);
cout<<"按快速排序排出的顺序为:"<<endl;
print(a);
}