重学C++ 使用引用传递的选择排序

//源程序来自《C++程序员教程》

#include<iostream>
using std::cout;
using std::endl;

#include<iomanip>
using std::setw;

void selectionSort(int* const,const int);
void swap(int* const,int* const);

int main()
{
	const int arraySize=10;
	int a[arraySize]={2,4,6,8,10,12,46,88,45,56};

	cout<<"Data items in original order"<<endl;

	for(int i=0;i<arraySize;i++)
	{
		cout<<setw(4)<<a[i];
	}
	
	selectionSort(a,arraySize);
	cout<<"\nData items in ascending order\n";

	for(int j=0;j<arraySize;j++)
	{
		cout<<setw(4)<<a[j];
	}
	
	cout<<endl;
	return 0;
}

void selectionSort(int* const array,const int size)
{
	int smallest;
	for(int i=0;i<size-1;i++)
	{
		smallest=i;
		for(int index=i+1;index<size;index++)
		{
			if(array[index]<array[smallest])
			{
				smallest=index;
			}
		}
		swap(&array[i],&array[smallest]);
	}
}

void swap(int* const element1Ptr,int* const element2Ptr)
{
	int hold=*element1Ptr;
	*element1Ptr=*element2Ptr;
	*element2Ptr=hold;
}