剑指Offer——快速排序

主要思路：分治法，挑选出来一个中间数，将大于中间数和小于中间数的分成两组，然后组内排序，递归处理

以下代码在vs2015中调试运行无误

#include "stdafx.h"
#include<iostream>
using namespace std;
#include<time.h>
int RandomInRange(int start, int end)
{
	if (end>start)
	{
		srand(time(NULL));
		return start + rand() % ((end - start));//产生start~end之间的随机数
	}
}
void swap_element(int *a, int *b)
{
	int temp;
	temp = *a;
	*a = *b;
	*b = temp;
}

int Partition(int data[], int length, int start, int end)
{
	if (data == NULL || length <= 0 || start<0 || end >= length)
	{
		cout << "error1!" << endl;
		exit(0);
	}
	int index = RandomInRange(start, end);
	swap_element(&data[index], &data[end]);
	int small = start - 1;
	for (index = start; index<end; index++)
	{
		if (data[index]<data[end])
		{
			++small;
			if (small != index)
			{
				swap_element(&data[index], &data[small]);
			}
		}
	}
	++small;
	swap_element(&data[small], &data[end]);
	return small;
}
void Quicksort(int data[], int length, int start, int end)
{
	if (start == end)
	{
		return;
	}
	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);
}
int main(void)
{
	int data[10] = { 1,4,7,0,6,10,3,8,2,9 };
	Quicksort(data, 10, 0, 9);
	for (int i = 0; i<10; i++)
		cout << data[i] << " ";
	cout << endl;
	while (1);
	return 0;
}