快速排序

int swap(int &a,int &b)
{
int temp;
temp = a;
a = b;
b = temp;
return 0;
}

int RandomInRange(int start, int end)
{
if(end > start)
{
srand(time(NULL));
return start + rand()%(end-start);
}
return start;
}


int partition(int data[],int length,int start,int end)
{

if(data == NULL || length <= 0 || start < 0 || end >= length )
// throw exception("error");
return 1;
int index = RandomInRange(start, end);
swap(data[index], data[end]);
int small = start - 1;
for (index = start; index < end; ++ index)
{
if(data[index] < data[end])
{
++small;
if(small != index)
swap(data[index], data[small]);
}
}
++small;
swap(data[small], data[end]);
return small;
}
int quickSort(int data[],int length,int start, int end)
{
if(start == end)
return 0;
int index = partition(data, length, start ,end);
if(index > start)
quickSort(data, length, start, index - 1);
if (index < end)
quickSort(data, length, index + 1,end);
return 0;
}