选择排序与冒泡排序模板

备注：sizeof(a)/sizeof(a[0])的作用为求数组的元素个数

详细了解可看这篇博客：(1条消息) 关于sizeof(arr)/sizeof(arr[0])解读（plus细节讲解增加）_CTGU-Yoghurt的博客-CSDN博客_sizeof(arr)/sizeof(arr[0])https://blog.csdn.net/weixin_60536621/article/details/120583464?spm=1001.2014.3001.5502

选择排序:

void xuanzhe()
{
	for (int i = 0; i < sizeof(a)/sizeof(a[0])-1; i++)
	{
		for (int j = i+1; j < sizeof(a)/sizeof(a[0]); j++) {
			if (a[i] > a[j])
			{
				int t = a[i];
				a[i] = a[j];
				a[j] = t;
			}
		}
	}
}

冒泡排序:

void maopao()
{
	for (int i = 0; i < sizeof(a) / sizeof(a[0])-1; i++)
	{
		for (int j = 0 ; j < sizeof(a) / sizeof(a[0])-i-1; j++) {
			if (a[j] > a[j+1])
			{
				int t = a[j];
				a[j] = a[j+1];
				a[j+1] = t;
			}
		}
	}
}

测试代码：

#include<iostream>
using namespace std;

int a[] = { 123,12,312,3,124,3,4534,5,423,4};
void xuanzhe()
{
	for (int i = 0; i < sizeof(a)/sizeof(a[0])-1; i++)
	{
		for (int j = i+1; j < sizeof(a)/sizeof(a[0]); j++) {
			if (a[i] > a[j])
			{
				int t = a[i];
				a[i] = a[j];
				a[j] = t;
			}
		}
	}
}
void maopao()
{
	for (int i = 0; i < sizeof(a) / sizeof(a[0])-1; i++)
	{
		for (int j = 0 ; j < sizeof(a) / sizeof(a[0])-i-1; j++) {
			if (a[j] > a[j+1])
			{
				int t = a[j];
				a[j] = a[j+1];
				a[j+1] = t;
			}
		}
	}
}
int main()
{
	maopao();
	for (int i = 0; i < sizeof(a) / sizeof(a[0]); i++)
	{
		cout << a[i]<<" ";
	}
}