帮忙看看这段C++程序哪里出了错!关于快速排序的!

来源:百度知道 编辑:UC知道 时间:2024/06/01 12:30:55
#include<iostream.h>
#include<stdio.h>
void main()
{
int a[9]={3,56,36,12,76,35,59,25,10};
int c,left,right;
int *pData;
void QuickSort(int *pData, int left, int right);
cout<<"3,56,36,12,76,35,59,25,10"<<'\n';
cout<<"请选择排序方法:"<<'\n'<<"1.insertion sort"<<'\n'<<"2.bubble sort"<<"\n"<<"3.select sort"<<"\n"<<"4.quicksort"<<'\n';
cin>>c;
{
if(c==4)
{

{
int i, j;
int middle, iTemp;
i = left;
j = right;

middle = pData[(left + right) / 2]; //求中间值
do
{
while ((pData[i] < middle) && (i < right)) //从左扫描大于中值的数
i+

#include<iostream.h>
#include<stdio.h>
void QuickSort(int *pData, int left, int right);
void main()
{
int a[9]={3,56,36,12,76,35,59,25,10};
int c,left=0,right=8;
int *pData=a;
cout<<"3,56,36,12,76,35,59,25,10"<<'\n';
cout<<"请选择排序方法:"<<'\n'<<"1.insertion sort"<<'\n'<<"2.bubble sort"<<"\n"<<"3.select sort"<<"\n"<<"4.quicksort"<<'\n';
cin>>c;

if(c==4)

QuickSort(a,left,right);
}

void QuickSort(int *pData, int left, int right)
{
int i, j;
int middle, iTemp;
i = left;
j = right;

middle = pData[(left + right) / 2]; //求中间值
do
{
while ((pData[i] < middle) && (i < right)) //从左扫描大于中值的数
i++;
whil