c++ 排序

一、快速排序

#include<iostream>
#include<string>
using namespace std;

void qiucksort(string &s,int begin,int end)
{
	if (begin > end)return; 
	int tmp = s[begin];//基准
	int i = begin;//左
	int j = end;//右
	while (i != j)
	{
		while (s[j] >= tmp && j > i) j--;//从右往左招小于基准的数
		if (j > i)s[i] = s[j];
		while (s[i] <= tmp && i < j) i++;//从左往右找大于基准的数
		if (j > i)s[j] = s[i];
	}
	s[i] = tmp;
	qiucksort(s, begin, i - 1);
	qiucksort(s, i+1, end);
}

int main()
{
	string s;
	while (cin >> s)
	{
		int len = s.length();
		qiucksort(s,0,len-1);
		cout << s << endl;
	}
	return 0;
}

二、 冒泡排序

#include<iostream>
#include<string>
using namespace std;

void maopaosort(string& s)
{
	for (int i = 0; i < s.length()-1; i++)
	{
		for (int j = 0; j < s.length() - i-1; j++)
		{
			if (s[j] > s[j + 1])
			{
				char temp = s[j + 1];       // 元素交换
				s[j + 1] = s[j];
				s[j] = temp;
			}
		}
	}
}

int main()
{
	string s;
	while (cin >> s)
	{
		int len = s.length();
		maopaosort(s);
		cout << s << endl;
	}
	return 0;
}

三、选择排序

#include<iostream>
#include<string>
using namespace std;
void choosesort(string& s)
{
	char min=s[0];
	for (int i = 0; i < s.length() - 1; i++)
	{
		min = i;
		for (int j = i+1; j < s.length() ; j++)
		{
			if (s[j]< s[min])
			{
				min = j;
			}
		}
		char temp = s[min];       // 元素交换
		s[min] = s[i];
		s[i] = temp;
	}
}



int main()
{
	string s;
	while (cin >> s)
	{
		int len = s.length();
		choosesort(s);
		cout << s << endl;
	}
	return 0;
}

四 插入排序

#include<iostream>
#include<string>

using namespace std;


void insertsort(string &s)
{
	int j;
	char temp;//储存当前的值
	for (int i = 1; i < s.length(); i++)
	{
		temp = s[i];
		for (j = i - 1; j >= 0 && s[j] > temp; j--)//有比当前值大的数，则数组一直向后挪
		{
			s[j + 1] = s[j];
		}
		s[j + 1] = temp;//插入当前值
	}

}

int main()
{
	string m;
	while (cin >> m)
	{
		insertsort(m);
		cout << m << endl;
	}
	return 0;
}

五、希尔排序

#include<iostream>
#include<string>
using namespace std;


void shellsort(string &s)
{
	int gap=s.length()/2;
	int j;
	char temp;
	while (gap)//分组进行插入排序
	{
		for (int i = gap; i < s.length(); i++)//进行插入排序
		{
			temp = s[i];
			for (j = i-gap ; j >=0&&s[j]>temp; j=j- gap)
			{
				s[j+gap ] = s[j];
			}
			s[j + gap] = temp;
		}
		gap = gap / 2;
	}
}

int main()
{
	string m;
	while (cin >> m)
	{
		shellsort(m);
		cout << m << endl;
	}
	return 0;
}

六、归并排序

#include<iostream>
using namespace std;

void sort(int a[], int left, int mid, int right, int temp[]);
void mergesort(int a[],int left,int right,int temp[])
{
	int mid;
	if (left < right)
	{
		mid = (left + right) / 2;
		mergesort(a, left, mid, temp);//递归调用最小分组
		mergesort(a, mid+1, right, temp);
		sort(a, left, mid, right, temp);//顺序合并小分组
	}
}

void sort(int a[],int left,int mid,int right,int temp[])
{
	int i = left;
	int j = mid+1;
	int t = 0;
	while (i <= mid && j <= right)//每次比较将最小得放入新数组
	{
		if (a[i] > a[j])
		{
			temp[t] = a[j];
			t++;
			j++;
		}
		else {
			temp[t] = a[i];
			t++;
			i++;
		}
	}
	
	while (i <= mid)//将左分组中剩余放入已排序数组
	{
		temp[t] = a[i];
		t++;
		i++;
	}
	while (j <= right)//将右分组中剩余放入已排序数组
	{
		temp[t] = a[j];
		t++;
		j++;
	}

	t = 0;
	while (left <= right)//将已排序数组还原到原数组
	{
		a[left] = temp[t];
		left++;
		t++;
	}
}


int main()
{
	int a[9] = { 9,8,7,6,5,4,3,2,1 };
	int  temp[9];
	mergesort(a, 0, 8, temp);

	for (int i = 0; i < 9; i++)
	{
		cout << a[i] << " ";
	}
	return 0;
}

七、堆排序

#include<iostream>
using namespace std;

void swap(int arr[],int a,int b)
{
	int temp = arr[a];
	arr[a] = arr[b];
	arr[b] = temp;
}

void hepify(int a[], int n,int i)
{
	if (i > n)return;
	int left = 2 * i+1;
	int right = 2 * i + 2;
	int max=i;
	if (a[left] > a[max] && left < n)
	{
		max = left;
	}
	if (a[right] > a[max] && right < n)
	{
		max = right;
	}
	if (max != i)
	{
		swap(a,i,max);
		hepify(a, n, max);
	}
}

void buidlheap(int a[], int n)
{
	int len = n - 1;
	int begin = (len-1) / 2;
	for (int i = begin; i >=0; i--)
	{
		hepify(a, n, i);
	}
}

void duisort(int a[], int n)
{
	buidlheap(a, n);
	int i;
	for (i = n - 1; i >= 0; i--)
	{
		swap(a, i,0);
		hepify(a, i, 0);
	}


}



int main()
{
	int a[9] = { 9,8,7,6,5,4,3,2,1 };
	int  temp[9];
	duisort(a,9);

	for (int i = 0; i < 9; i++)
	{
		cout << a[i] << " ";
	}
	return 0;
}

八、计数排序

#include<iostream>
using namespace std;




void jishusort(int a[],int len)
{
	int max=a[0];
	int min=a[0];
	for (int i = 1; i < len; i++)
	{
		if (a[i] > max)max = a[i];
		if (a[i] < min)min = a[i];
	}

	int l = max - min + 1;
	int* temp = new int[l]{0};
	for (int i = 0; i < len; i++)
	{
		temp[a[i]-min]++;
	}

	int sum = 0;
	for (int i = 0; i < l; i++)
	{
		sum += temp[i];
		temp[i]=sum;
	}


	int* fi = new int[len] {0};
	for (int i = len-1; i >=0; i--)
	{
		fi[temp[a[i] - min]-1] = a[i];
		temp[a[i] - min]--;
	}

	for (int i = 0; i < 11; i++)
	{
		cout << fi[i] << " ";
	}
}

int main()
{
	int data[] = { 1,3,5,7,9,11,13,15,17,19,21 };
	jishusort(data, 11);
	
	return 0;
}

九、基数排序

#include<iostream>
using namespace std;


int maxbit(int data[], int n)
{

	  int d = 1; 
		int p = 10;
		for(int i = 0; i < n; ++i)
		{
			while(data[i] >= p)
			{
				p *= 10;
				++d;
			}
		}
		return d;
}


void radsort(int data[],int n)
{
	int d = maxbit(data, n);

	int* temp = new int[n];
	int* count = new int[10];

	int i, j, k;
	int radix = 1;

	for (int i = 1; i <= d; i++)//总共排序d次
	{
		for (j = 0; j < 10; j++)
			count[j] = 0; //每次分配前清空计数器
		for (j = 0; j < n; j++)
		{
			k = (data[j] / radix) % 10; //统计每个桶中的记录数
			count[k]++;
		}
		for (j = 1; j < 10; j++)
			count[j] = count[j - 1] + count[j]; //将tmp中的位置依次分配给每个桶
		for (j = n - 1; j >= 0; j--)
		{
			k = (data[j] / radix) % 10;
			temp[count[k] - 1] = data[j];
			count[k]--;
		}
		for (j = 0; j < n; j++) //将临时数组的内容复制到data中
			data[j] = temp[j];
		radix *= 10;
	}
}

int main()
{
	int data[] = { 1,7,3,5,9,11,13,15,17,19,21 };
	radsort(data, 11);
	
	for (int i = 0; i < 11; i++)
	{
		cout << data[i] << " ";
	}
	return 0;
}