各种排序的方法

最新推荐文章于 2024-08-02 23:27:55 发布

闻术

最新推荐文章于 2024-08-02 23:27:55 发布

阅读量143

点赞数

分类专栏： C语言实现初阶的数据结构文章标签：算法数据结构 c语言快速排序归并排序

本文链接：https://blog.csdn.net/l_shadow_m/article/details/130177588

版权

C语言实现初阶的数据结构专栏收录该内容

10 篇文章 0 订阅

订阅专栏

思维导图

插入排序

直接插入排序

void InsertSort(int* a, int n)
{
	// 控制end的位置
	for (int i = 0; i < n - 1; i++)
	{
		// 单趟排序
		int end = i;
		int tmp = a[end + 1];
		while (end >= 0)
		{
			if (tmp < a[end])
			{
				a[end + 1] = a[end];
				end--;
			}
			else
			{
				break;
			}
		}
		a[end + 1] = tmp;
	}
}

希尔排序（增量缩小排序）

void ShellSort(int* a, int n)
{
	int gap = n;
	while (gap > 1)
	{
		// 保证最后一次gap==1时为直接插入排序
		gap = gap / 3 + 1;
		// gap组数据交替进行排序
		for (int i = 0; i < n - gap; i++)
		{
			// 单趟分组排序
			int end = i;
			int tmp = a[end + gap];
			while (end >= 0)
			{
				if (tmp < a[end])
				{
					a[end + gap] = a[end];
					end -= gap;
				}
				else
				{
					break;
				}
			}
			a[end + gap] = tmp;
		}
	}
}

选择排序

直接选择排序

void SelectSort(int* a, int n)
{
	int begin = 0;
	int end = n - 1;

	while (begin < end)
	{
		int maxi = begin, mini = begin;

		// 找到最大值和最小值的下标
		for (int i = begin + 1; i < end + 1; i++)
		{
			if (a[i] > a[maxi])
			{
				maxi = i;
			}
			if (a[i] < a[mini])
			{
				mini = i;
			}
		}
		
		Swap(&a[begin], &a[mini]);
		// 若begin == maxi，此时maxi位置元素被换到了mini所在位置
		if (begin == maxi)
		{
			maxi = mini;
		}
		Swap(&a[end], &a[maxi]);

		begin++;
		end--;
	}
}

堆排序

void Swap(int* x, int* y)
{
	int tmp = *x;
	*x = *y;
	*y = tmp;
}

void AdjustDown(int* a, int size, int parent)
{
	int child = parent * 2 + 1;
	while (child < size)
	{
		// 选出两个child小的那个（小堆） 或者大的那个（大堆）
		if (child + 1 < size && a[child + 1] > a[child])
		{
			child++;
		}
		if (a[child] > a[parent])
		{
			Swap(&a[parent], &a[child]);
			parent = child;
			child = parent * 2 + 1;
		}
		else
		{
			break;
		}
	}
}

void HeapSort(int* a, int n)
{
	// 降序--建小堆
	// 升序--建大堆
	for (int i = n - 1 - 1 / 2; i >= 0; i--)
	{
		AdjustDown(a, n, i);
	}

	int end = n - 1;
	while (end > 0)
	{
		Swap(&a[0], &a[end]);
		AdjustDown(a, end, 0);
		end--;
	}
}

交换排序

冒泡排序

void BubbleSort(int* a, int n)
{
	for (int j = 0; j < n - 1; j++)
	{
		int exchange = 0;
		for (int i = 1; i < n - j; i++)
		{
			if (a[i - 1] > a[i])
			{
				Swap(&a[i - 1], &a[i]);
				exchange = 1;
			}
		}
		if (exchange == 0)
		{
			// 这一趟没有进行过交换，说明数组已经有序
			break;
		}
	}
}

快速排序

hoare版本

int PartSort1(int* a, int begin, int end)
{
	int left = begin;
	int right = end;
	int keyi = left;

	while (left < right)
	{
		// 加一个left < right判断，防止left或者right直接走出数组范围了
		while (left < right && a[right] >= a[keyi])
		{
			right--;
		}
		while (left < right && a[left] <= a[keyi])
		{
			left++;
		}
		Swap(&a[left], &a[right]);
	}
	Swap(&a[keyi], &a[left]);
	keyi = left;
	return keyi;
}

void QuickSort(int* a, int begin, int end)
{
	//callCount++;
	if (begin == end || begin > end)
	{
		return;
	}

	int keyi = PartSort1(a, begin, end);
	QuickSort(a, begin, keyi - 1);
	QuickSort(a, keyi + 1, end);
}

挖坑法

int PartSort2(int* a, int begin, int end)
{
	int key = a[begin];
	int piti = begin;
	int left = begin, right = end;

	while (left < right)
	{
		while (left < right && a[right] >= key)
		{
			right--;
		}
		a[piti] = a[right];
		piti = right;

		while (left < right && a[left] <= key)
		{
			left++;
		}
		a[piti] = a[left];
		piti = left;
	}
	a[piti] = key;
	return piti;
}

void QuickSort(int* a, int begin, int end)
{
	//callCount++;
	if (begin == end || begin > end)
	{
		return;
	}

	int keyi = PartSort2(a, begin, end);
	QuickSort(a, begin, keyi - 1);
	QuickSort(a, keyi + 1, end);
}

前后指针法

int PartSort3(int* a, int begin, int end)
{
	int prev = begin;
	int cur = begin + 1;
	int keyi = prev;

	// keyi处的位置大概是中位数
	int mid = GetMidIndex(a, begin, end);
	Swap(&a[keyi], &a[mid]);

	while (cur <= end)
	{
		if (a[cur] < a[keyi] && ++prev != cur)
			Swap(&a[prev], &a[cur]);

		cur++;
	}
	Swap(&a[keyi], &a[prev]);
	keyi = prev;
	return keyi;
}

void QuickSort(int* a, int begin, int end)
{
	//callCount++;
	if (begin == end || begin > end)
	{
		return;
	}

	int keyi = PartSort2(a, begin, end);
	QuickSort(a, begin, keyi - 1);
	QuickSort(a, keyi + 1, end);
}

快排的优化

三数取中

int GetMidIndex(int* a, int begin, int end)
{
	int mid = (begin + end) / 2;
	if (a[begin] > a[mid])
	{
		if (a[mid] > a[end])
		{
			return mid;
		}
		// a[mid] <a[end]
		else if (a[begin] > a[end])
		{
			return end;
		}
		else
		{
			return begin;
		}
	}
	// a[mid] > a[begin]
	else
	{
		if (a[begin] > a[end])
		{
			return begin;
		}
		// a[end] > a[begin]
		else if (a[mid] > a[end])
		{
			return end;
		}
		else
		{
			return mid;
		}
	}
}

减小递归调用次数

void QuickSort(int* a, int begin, int end)
{
	//callCount++;
	if (begin == end || begin > end)
	{
		return;
	}
    
    // 优化 
	if (end - begin < 10)
	{
		InsertSort(a + begin, end - begin + 1);
		return;
	}

	int keyi = PartSort3(a, begin, end);
	QuickSort(a, begin, keyi - 1);
	QuickSort(a, keyi + 1, end);
}

非递归快排

排序的时候还是要用到前面的三种方法

void QuickNonR(int* a, int begin, int end)
{
	ST st;
	StackInit(&st);
	StackPush(&st, end);
	StackPush(&st, begin);

	while (!StackEmpty(&st))
	{
		begin = StackTop(&st);
		StackPop(&st);

		end = StackTop(&st);
		StackPop(&st);

		int keyi = PartSort3(a, begin, end);

		if (keyi + 1 < end)
		{
			StackPush(&st, end);
			StackPush(&st, keyi + 1);
		}
		if (begin < keyi - 1)
		{
			StackPush(&st, keyi - 1);
			StackPush(&st, begin);
		}
	}
	StackDestroy(&st);
}

归并排序

递归法

void _MergeSort(int* a, int begin, int end, int* tmp)
{
	if (begin == end)
	{
		return;
	}
	int mid = (end + begin) / 2;
	
	// 划分区间
	_MergeSort(a, begin, mid, tmp);
	_MergeSort(a, mid + 1, end, tmp);
	
	// 归并
	int begin1 = begin, end1 = mid;
	int begin2 = mid + 1, end2 = end;
	int i = begin1;// 遍历tmp数组

	while (begin1 <= end1 && begin2 <= end2)
	{
		if (a[begin1] < a[begin2])
		{
			tmp[i++] = a[begin1++];
		}
		else
		{
			tmp[i++] = a[begin2++];
		}
	}

	// 没走完的区间剩下的数直接放入数组
	while (begin1 <= end1)
	{
		tmp[i++] = a[begin1++];
	}

	while (begin2 <= end2)
	{
		tmp[i++] = a[begin2++];
	}
	memcpy(a + begin, tmp + begin, sizeof(int) * (end - begin + 1));
}

void MergeSort(int* a, int n)
{
	int* tmp = (int*)malloc(sizeof(int) * n);
	if (tmp == NULL)
	{
		printf("malloc fail");
		exit(-1);
	}

	_MergeSort(a, 0, n - 1, tmp);
	free(tmp);
}

非递归

void MergeSortNonR1(int* a, int n)
{
	int* tmp = (int*)malloc(sizeof(int) * n);
	if (tmp == NULL)
	{
		printf("malloc fail");
		exit(-1);
	}

	int gap = 1;
	while (gap < n)
	{
		printf("gap:%d ->", gap);
		for (int i = 0; i < n; i += 2 * gap)
		{
			int begin1 = i, end1 = i + gap - 1;
			int begin2 = i + gap, end2 = i + 2 * gap - 1;
			int j = begin1;// 遍历tmp数组

			// 修改区间，防止数组越界
			if (end1 >= n)
			{
				end1 = n - 1;
				begin2 = n;
				end2 = n - 1;
			}
			else if (begin2 >= n)
			{
				begin2 = n;
				end2 = n - 1;
			}
			else if (end2 >= n)
			{
				end2 = n - 1;
			}
			printf("[%d,%d]-[%d,%d]  ", begin1, end1, begin2, end2);

			while (begin1 <= end1 && begin2 <= end2)
			{
				if (a[begin1] <= a[begin2])
				{
					tmp[j++] = a[begin1++];
				}
				else
				{
					tmp[j++] = a[begin2++];
				}
			}

			// 没走完的区间剩下的数直接放入数组
			while (begin1 <= end1)
			{
				tmp[j++] = a[begin1++];
			}

			while (begin2 <= end2)
			{
				tmp[j++] = a[begin2++];
			}
		}
		printf("\n");
		gap *= 2;
		memcpy(a, tmp, sizeof(int) * n);
	}
}

void MergeSortNonR2(int* a, int n)
{
	int* tmp = (int*)malloc(sizeof(int) * n);
	if (tmp == NULL)
	{
		printf("malloc fail");
		exit(-1);
	}

	int gap = 1;
	while (gap < n)
	{
		//printf("gap:%d ->", gap);
		for (int i = 0; i < n; i += 2 * gap)
		{
			int begin1 = i, end1 = i + gap - 1;
			int begin2 = i + gap, end2 = i + 2 * gap - 1;
			int j = begin1;// 遍历tmp数组

			// 修改区间，防止数组越界
			if (end1 >= n || begin2 >= n)
			{
				break;
			}
			else if (end2 >= n)
			{
				end2 = n - 1;
			}
			//printf("[%d,%d]-[%d,%d]  ", begin1, end1, begin2, end2);
			int m = end2 - begin1 + 1;// 修正后数组的范围

			while (begin1 <= end1 && begin2 <= end2)
			{
				if (a[begin1] < a[begin2])
				{
					tmp[j++] = a[begin1++];
				}
				else
				{
					tmp[j++] = a[begin2++];
				}
			}

			// 没走完的区间剩下的数直接放入数组
			while (begin1 <= end1)
			{
				tmp[j++] = a[begin1++];
			}

			while (begin2 <= end2)
			{
				tmp[j++] = a[begin2++];
			}
			memcpy(a + i, tmp + i, sizeof(int) * m);
		}
		//printf("\n");
		gap *= 2;
	}
}

非比较排序

计数排序

void CountSort(int* a, int n)
{
	// 找出数组最大和最小，算出范围开一个数组
	int max = a[0];
	int min = a[0];
	for (int i = 1; i < n; i++)
	{
		if (a[i] < min)
		{
			min = a[i];
		}
		else
		{
			max = a[i];
		}
	}
	int range = max - min + 1;
	int* count = (int*)malloc(sizeof(int) * range);
	if (count == NULL)
	{
		printf("malloc fail");
		exit(-1);
	}
	memset(count, 0, range * sizeof(int));

	// 对数组进行计数
	for (int i = 0; i < n; i++)
	{
		count[a[i] - min]++;
	}
	
	// 将数组重新排序
	int i = 0;// 遍历count
	int j = 0;// 遍历range
	while (i < range)
	{
		while (count[i]--)
		{
			a[j++] = i + min;
		}
		i++;
	}
	free(count);
}

最后这里有一个排序的OJ题，可以去拿排序函数跑一下

912. 排序数组 - 力扣（LeetCode）