C++冒泡排序和选择排序例子

#include <iostream>
using namespace std;

void BubblueSort(int* slist, int length)//冒泡排序
{
	for (int i = 0; i < length - 1; i++)
	{
		for (int j = 0; j < length - 1 - i; j++)
		{
			int temp = 0;

			if (slist[j] > slist[j + 1])
			{
				temp = slist[j];
				slist[j] = slist[j + 1];
				slist[j + 1] = temp;
			}
		}
	}
}

void SelectSort(int* slist, int length) //选择排序
{
	int min, temp=0;
	for (int i = 0; i < length - 1; i++)
	{
		min = i;
		for (int j = i + 1; j < length; j++)
		{
			if (slist[j] < slist[min])
			{
				min = j;
			}
			temp = slist[i];
			slist[i] = slist[min];
			slist[min] = temp;
		}
	}
}

int main()
{
	int list[10] = {91,8,17,16,15,41,3,2,1,10};
	int list2[10] ={21,313,54,768,7967,766,45,34,23,0};

	BubblueSort(list, 10);

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

	cout << endl;

	SelectSort(list2, 10);
	for (int i = 0; i < 10; i++)
	{
		cout << list2[i] << " ";
	}

	return 0;

}