归并排序和快速排序

1、快速排序

一般Partition算法的缺点就是当重复元素较多时，会导致分区不均匀，如果使用3-wayPartition算法，就能够减小子问题的规模，提高算法的效率。

应用：

1）快速排序，2）线性时间找第k小，3）求众数问题

void threeP(int* a, int* p, int* r)
{
	int x = a[*p], k = *p + 1;
	while (k <= *r)
	{
		if (a[k] == x)
			k++;
		else if (a[k] < x)
			Swap(&a[*p++], &a[k++]);
		else
			Swap(&a[k], &a[*r--]);
	}
}

这里犯了一个错误，就是后置++和解引用符的优先级，*p++是先执行p++，再解引用，这时会导致p指针移向下一个位置，不是指向原来那个变量。 

#include<stdio.h>

void Swap(int* a, int* b)
{
	int temp = *a;
	*a = *b;
	*b = temp;
}
int twoPartition(int* a, int p, int r)
{
	int i = p, j = r + 1;
	int x = a[p];
	while (1)
	{
		while (a[++i] <= x);
		while (a[--j] > x);
		if (i >= j)
			break;
		Swap(&a[i], &a[j]);
	}
	a[p] = a[j];
	a[j] = x;

	return j;
}

void Quicksort(int* a, int p, int r)
{
	if (p >= r)
		return;
	int j = twoPartition(a, p, r);
	Quicksort(a, p, j - 1);
	Quicksort(a, j + 1, r);
}

void threeP(int* a, int* p, int* r)
{
	int i = *p, j = *r;
	int x = a[i], k = i + 1;
	while (k <= j)
	{
		if (a[k] == x)
			k++;
		else if (a[k] < x)
			Swap(&a[i++], &a[k++]);
		else
			Swap(&a[k], &a[j--]);
	}
	*p = i, * r = j;
}

void Quicksortthree(int* a, int left, int right)
{
	if (left >= right)
		return;
	int lleft = left, rright = right;
	threeP(a, &lleft, &rright);
	Quicksortthree(a, left, lleft - 1);
	Quicksortthree(a, rright + 1, right);
}

int main()
{
	int a[]= { 1,5,3,4,6,2,743,489,248,3891,864,2004,1,8 };
	int len = sizeof(a) / sizeof(int);
	/*Quicksort(a, 0, len - 1);*/
	Quicksortthree(a, 0, len - 1);
	for (int i = 0; i < len; i++)
		printf("%d ", a[i]);
	int p = 1, q = 2;
	int* m = &p, *n = &q;
	*m++, (*n)++;
	printf("*m=%#xd *n=%d\n", *m, *n);

	return 0;
}	

不做过多解释。

2、归并排序

代码：

#include<stdio.h>
#include<stdlib.h>

const int maxsize = 1000;
int b[maxsize];


void mergeandcopy(int* a, int left, int right);
void mergesort(int* a, int left, int right);


int main()
{
	int a[14] = { 1,5,3,4,6,2,743,489,248,3891,864,2004,1,8 };
	mergesort(a, 0, 13);

	for (int i = 0; i < 14; i++)
		printf("%d ", a[i]);

	return 0;
}



void mergesort(int* a, int left,int right)
{
	//递归出口
	if (right - left <= 0)
	{
		return;
	}


	int mid = (right + left) / 2;
	mergesort(a, mid+1,right);
	mergesort(a, left,mid);
	mergeandcopy(a, left,right);
}

void mergeandcopy(int* a, int left, int right)
{
	int i=left, k=0, j;
	int mid = (left + right) / 2;
	j = mid + 1;
	while (i <= mid && j <= right)
	{
		if (a[i] < a[j])
		{
			b[k++] = a[i++];
		}
		else
		{
			b[k++] = a[j++];
		}
	}
	while (i <= mid)
		b[k++] = a[i++];
	while (j <= right)
		b[k++] = a[j++];
	for (int i = 0; i < k; i++)
		a[left + i] = b[i];
}

这里是使用的递归算法，非递归算法还没学。