快速排序、插入排序、归并排序

#include <iostream>
#include <vector>
#include <stack>
using namespace std;


//快速排序
void quicksort(int a[],int low, int high)
{
	if(NULL == a || low <0||high<0)
	{
		return;
	}
	int key = a[low];
	int i = low;
	int j = high;
	while(i<j)
	{
		while(i<j&&a[j]>=key) //从后往前寻找第一个小于key的值
		{
			j--;
		}
		if(i<j)
		{
			a[i] = a[j];
			i++;
			while(i<j&&a[i]<=key)//从前往后找第一个大于key的值
			{
				i++;
			}
			if(i<j)
			{
				a[j] = a[i];
				j--;
			}
		}

	}
	a[i] = key;
	if(low<i-1)
	{
		quicksort(a,low,i-1);
	}
	if(j+1<high)
	{
		quicksort(a,j+1,high);
	}
}

//插入排序
void insert(int a[],int n)
{
	int i = 0;
	int j = 0;
	int temp = 0;
	for(i = 1;i < n;i++)
	{
		j = i;
		while (j > 0&&a[j] > a[j-1])
		{
			temp = a[j];
			a[j] = a[j-1];
			a[j-1] = temp;
			j--;
		}
	}
}

//归并排序
void merge(int a[],int start,int mid,int end,int c[])
{
	int laIdx =start;
	int raIdx = mid+1;
	int k =0;
	int i = 0;
	while((laIdx <= mid)&&raIdx <= end)
	{
		if(a[laIdx]<=a[raIdx])
		{
			c[k++] = a[laIdx];
			laIdx++;
		}
		else
		{
			c[k++]=a[raIdx];
			raIdx++;
		}
		while(laIdx <= mid )
		{
			c[k++] = a[laIdx++];
		}
		while(raIdx <= end)
		{
			c[k++] = a[raIdx++];
		}
		for(i=0;i<k;i++)
		{
			a[start + i] = c[i];
		}

	}
}
void mergesort(int a[],int start,int end,int c[])
{
	int mid = 0;
	if(start < end)
	{
		mid = (start+end)/2;
		mergesort(a,start,mid,c);
		mergesort(a,mid+1,end,c);
		merge(a,start,mid,end,c);
	}
}

int main(void)  
{  
	int a[7] = {1,3,5,7,9,0,8};
	int c[10] ={0} ;
	mergesort(a,0,6,c);
	for(int i=0;i<7;i++)
	{
		cout<<a[i];
	}
	return 0;  
}