// Justin C. Miller
// University of Wisconsin Oshkosh
// Made for: http://www.geocities.com/neonprimetime.geo/index.html
// Date: 2001
// Borland Builder 4.0

//	input 10 numbers then sort from least to greatest

#include 

void swap ( int &num1 , int &num2 ) ;

int main()
{
	int numbers [ 10 ] ;

	cout << "Enter 10 numbers, this program will sort them" << endl ;
	cout << "from least to greatest" << endl ;
	for ( int g = 0 ; g < 10 ; ++g )
	{
		cout << "Enter number " << g << endl ;
		cin >> numbers [ g ] ;
	}
	for ( int k = 0 ; k < 10 ; ++ k )
	{
		for ( int y = k ; y < 10 ; ++y )
		{
			if ( numbers [ y ] < numbers [ k ] )
			{
				swap ( numbers [ y ] , numbers [ k ] ) ;
			}
		}
	}
	cout << endl ;
	for ( int u = 0 ; u < 10 ; ++u )
	{
		cout << numbers [ u ] << endl ;
	}
	return 0 ;
}

void swap ( int &num1 , int &num2 )
{
	int temp = num1 ;
	num1 = num2 ;
	num2 = temp ;
	return ;
}

    Source: geocities.com/neonprimetime.geo/cpp/cpp_SourceCode

               ( geocities.com/neonprimetime.geo/cpp)                   ( geocities.com/neonprimetime.geo)