看数据结构写代码（2） 选择排序 和 冒泡排序 算法优化

#include "stdafx.h"
//都是从小到大排序
void SelectionSort(int * array,int n){
	for (int i = 0; i < n-1; i++)
	{
		int minIndex = i;//最小值下标
		for (int j = i+1; j < n; j++)
		{
			if (array[minIndex] > array[j])
			{
				minIndex = j;
			}
		}
		if (minIndex != i)
		{
			int temp = array[minIndex];
			array[minIndex] = array[i];
			array[i] = temp;
		}
	}
}

void BubbleSort(int * array,int n){
	for (int i = 0; i < n - 1; i++)
	{
		bool isChange = false;
		for (int j = 0; j < n - i-1; j++)
		{
			if (array[j] > array[j+1])
			{
				int temp = array[j];
				array[j] = array[j+1];
				array[j+1] = temp;
				isChange = true;
			}
		}
		if (isChange == false)
		{
			return;
		}
	}
}

void printArray(int * array,int n){
	printf("------------------------------\n");
	for (int i = 0; i < n; i++)
	{
		printf("%d\n",array[i]);
	}
	printf("------------------------------\n");
}

int _tmain(int argc, _TCHAR* argv[])
{
	int a[] = {23,45,2342,22,43,23,1,66,99,100};
	int b[] = {23,45,2342,22,43,23,1,66,99,100};
	SelectionSort(a,10);
	printArray(a,10);
	BubbleSort(b,10);
	printArray(b,10);
	return 0;
}