排序（6）——快速排序及其优化

“test.cpp”

<strong><span style="font-size:18px;"><strong><span style="font-size:18px;">#include<iostream>
using namespace std;

int MidNode(int* arr,int left,int right)
{
	int tmp = arr[left];

	while(left < right)
	{
		while(left < right && arr[right] >= tmp)
		{
			right--;
		}
		swap(arr[left],arr[right]);

		while(left < right && arr[left] <= tmp)
		{
			left++;
		}
		swap(arr[left],arr[right]);
	}

	return left;
}
void QuickSort(int* arr,int left,int right)
{
	if(left < right)
	{
		int mid = MidNode(arr,left,right);

		QuickSort(arr,left,mid-1);
		QuickSort(arr,mid+1,right);
	}
}
void test()
{
	int arr[] = {5,2,3,9,4,7,0,6,1,8};
	size_t size = sizeof(arr)/sizeof(arr[0]);
	QuickSort(arr,0,size-1);

	for(int i = 0;i < size;i++)
	{
		cout<<arr[i]<<" ";
	}
	cout<<endl;
}
int main()
{
	test();
	return 0;
}</span></strong></span></strong>

“test_OP.cpp”

#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;


void MinLeft(int* arr,int left,int right)
{
	int mid = (left + right) / 2;

	if(arr[left] > arr[right])
	{
		swap(arr[left],arr[right]);
	}
	if(arr[mid] > arr[right])
	{
		swap(arr[mid],arr[right]);
	}
	if(arr[left] > arr[mid])
	{
		swap(arr[left],arr[mid]);
	}

}
int MidNode(int* arr,int left,int right)
{
	MinLeft(arr,left,right);
	int tmp = arr[left];

	while(left < right)
	{
		while(left < right && arr[right] >= tmp)
		{
			right--;
		}
		arr[left] = arr[right];

		while(left < right && arr[left] <= tmp)
		{
			left++;
		}
		arr[right] = arr[left];
	}

	arr[left] = tmp;
	return left;
}
void QuickSort(int* arr,int left,int right)
{
	if(left < right)
	{
		int mid = MidNode(arr,left,right);

		QuickSort(arr,left,mid-1);
		QuickSort(arr,mid+1,right);
	}
}
void test()
{
	//int arr[] = {5,2,3,9,4,7,0,6,1,8};
	int arr[] = {9,2,8,3,4,6,0,1,7,5};
	size_t size = sizeof(arr)/sizeof(arr[0]);
	QuickSort(arr,0,size-1);

	for(int i = 0;i < size;i++)
	{
		cout<<arr[i]<<" ";
	}
	cout<<endl;
}
int main()
{
	test();
	system("pause");
	return 0;
}