常见排序算法C/C++实现总结

在数据结构与算法中常见的排序算法有：

1.插入排序；

2.冒泡排序；

3.快速排序；

4.选择排序；

5.希尔排序

6.归并排序；

7.堆排序；

相关实现：

一、插入排序

#include <iostream>

void InsertSort(int arr[],int num)
{
	for (int i = 1; i < num; i++)
	{
		for (int j = i; j > 0; j--)
		{
			if (arr[j] < arr[j - 1])
			{
				int tmp = arr[j];
				arr[j] = arr[j - 1];
				arr[j - 1] = tmp;
			}
		}
	}
	std::cout << "after sort:" << std::endl;
	for (int k = 0; k < num; k++)
	{
		std::cout << arr[k] << std::endl;
	}
}


int main(void)
{
	std::cout << "begin sort:" << std::endl;
	int arr[10] = {3,4,2,1,6,8,9,4,0,7};
	InsertSort(arr,10);
	getchar();
	
	return 0;
}

</pre><p>二、冒泡排序</p><p></p><pre code_snippet_id="1769179" snippet_file_name="blog_20160718_3_7226114" name="code" class="cpp">#include <iostream>

void BubbleSort(int arr[],int num)
{
	for (int i = 0; i < num - 1; i++)
	{
		for (int j = 0; j < num - i - 1; j ++)
		{
			if (arr[j] > arr[j + 1])
			{
				int tmp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = tmp;
			}
		}
	}

	std::cout << "after sort:" << std::endl;
	for (int k = 0; k < num; k++)
	{
		std::cout << arr[k] << " ";
	}
}


int main(void)
{
	int arr[10] = { 3,4,2,1,6,8,9,4,0,7 };
	BubbleSort(arr, 10);
	getchar();
}

三、快速排序

void QuickSort(int arr[], int left, int right)
{
	if (left < right)
	{
		int key = arr[left];
		int low = left;
		int high = right;
		while (low < high)
		{
			while (low < high && arr[high] >= key)
			{
				high--;
			}
			if (low < high)
			{
				arr[low] = arr[high];
				low++;
			} else {
				break;
			}
			
			while (low < high && arr[low] <= key)
			{
				low++;
			}
			if (low < high)
			{
				arr[high] = arr[low];
				high--;
			} else {
				break;
			}
			
		}
		arr[low] = key;
		QuickSort(arr, left, low - 1);
		QuickSort(arr, low + 1, right);
	}
}

int main(void)
{

	int arr[10] = { 4,2,5,6,78,8,9,3,1,55 };
	QuickSort(arr,0,9);
	getchar();
	return 0;
}

四、选择排序

void SelectSort(int arr[], int num)
{
	for (int i = 0; i < num; i++)
	{
		int min = arr[i];
		int tmp;
		int index = i;

		for (int j = i + 1; j < num; j++)
		{
			if (min > arr[j])
			{
				min = arr[j];
				index = j;
			}
		}
		tmp = arr[i];
		arr[i] = min;
		arr[index] = tmp;
	}

	std::cout << "after sort:" << std::endl;
	for (int k = 0; k < num; k++)
	{
		std::cout << arr[k] << " ";
	}

}

int main(void)
{
	int arr[10] = { 2,1,4,56,7,6,8,9,11,3 };
	SelectSort(arr,10);
	getchar();
	return 0;
}

五、希尔排序

#include <iostream>

void ShellSort(int arr[], int num)
{
	int gap, i, j;
	for (gap = num / 2; gap > 0; gap /= 2)
	{
		for (i = 0; i < gap; i++)
		{
			for (j = i + gap; j < num; j+=gap)
			{
				if (arr[j] < arr[j - gap])
				{
					int tmp = arr[j];
					int k = j - gap;
					while (k >= 0 && arr[k] > tmp)
					{
						arr[k+gap] = arr[k];
						k -= gap;
					}
					arr[k + gap] = tmp;
				}
			}
		}
	}

	for (int k = 0; k < num; k++)
	{
		std::cout << arr[k] << " ";
	}
}


int main(void)
{
	int arr[10] = { 14,12,3,1,6,7,8,9,21,5 };
	ShellSort(arr, 10);
	getchar();
	return 0;
}

六、归并排序