十大经典排序算法之交换排序

交换排序算法:

一、冒泡法:

/*
冒泡排序,算法时间复杂度为:O(n^2),稳定的排序算法
Written by: Qinchao
Time:2016/12/3
Language: C++
*/
void bubblesort_6(vector<int> &_snum, int _len)
{
	int temp;
	for (int i = 0; i < _len; i++)
		for (int j = i+1; j < _len; j++)
			if (_snum[j] < _snum[j-1])
			{
				temp = _snum[j];
				_snum[j] = _snum[j-1];
				_snum[j-1] = temp;
			}
}

二、鸡尾酒排序算法,又称双向冒泡排序:

/*
鸡尾酒排序(双向冒泡排序),算法时间复杂度为:O(n^2), 稳定排序
Written by: Qinchao
Time:2016/12/3
Language: C++
*/
void shakersort_7(vector<int> &_snum, int _len)
{
	int left = 0, right = _len - 1;
	int temp = 0;
	int state = 0;
	while (left < right)
	{
		for (int i = left+1; i <= right; i++)
		{
			if (_snum[i] < _snum[i - 1])
			{
				temp = _snum[i];
				_snum[i] = _snum[i - 1];
				_snum[i - 1] = temp;
				state = i - 1;
			}
		}
		right = state;
		for (int i = right; i > left; i--)
		{
			if (_snum[i] < _snum[i - 1])
			{
				temp = _snum[i];
				_snum[i] = _snum[i - 1];
				_snum[i - 1] = temp;
				state = i;
			}
		}
		left = state;
	}
}

三、快速排序算法

/*
快速排序,算法时间复杂度为:O(nlogn), 不稳定排序
Written by: Qinchao
Time:2016/12/3
Language: C++
*/
int partion(vector<int> &_num, int left, int right)
{
	int x = _num[right];
	int i = left - 1;
	int temp;
	for (int j = left; j < right; j++)
	{
		if (_num[j] <= x)
		{
			i++;
			temp = _num[j];
			_num[j] = _num[i];
			_num[i] = temp;
		}
	}
	temp = _num[i + 1];
	_num[i + 1] = _num[right];
	_num[right] = temp;
	return i + 1;
}
void quicksort_8(vector<int> &_snum, int left, int right)
{
	if (left < right)
	{
		int q = partion(_snum, left, right);
		quicksort_8(_snum, left, q - 1);
		quicksort_8(_snum, q + 1, right);
	}
}


  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值