排序 -- 冒泡排序法[anank].cpp

包含选择排序法

/******************************************************************************************************
** Program Name : Bubble Sort
** Author       : Lu Jian Hua
** Time         : 2007-9-5 
*******************************************************************************************************/

#include <iostream>
using namespace std ;

const int MAX_SIZE = 10;

void Bubble_Sort(int *a, const int SIZE) ;

int main()
{
	int a[MAX_SIZE] = { 0 } ;
	cout << "-------------- Bubble Sort ----------------------" << endl << endl 
		 << "Please Enter The Numbers : " << endl << endl ;

	for (int i=0; i<MAX_SIZE; i++)
	{
		cout << "a[" << i << "] : " ;
		cin  >> a[i] ;
	}

	cout << "Before Sorting : " ;

	for (i=0; i<MAX_SIZE; i++)
		cout << a[i] << " " ;

	Bubble_Sort(a, MAX_SIZE) ;

	cout << endl << endl ;

	cout << "After  Sorting : " ;

	for (i=0; i<MAX_SIZE; i++)
		cout << a[i] << " " ;

	cout << endl << endl ;

	cout << "-------------- Selection Sort ----------------------" << endl << endl ;

	return 0 ;
}

void Bubble_Sort(int *a, const int SIZE) 
{
	int temp = 0 ;

	for (int i=SIZE-1; i>=1; i--)				// I : SIZE-1 ~ 1
	{
		for (int j=0; j<=i-1; j++)				// J :    0   ~ I-1
		{
			if (a[j] > a[j+1])
			{
				temp = a[j] ;
				a[j] = a[j+1] ;
				a[j+1] = temp ;
			}
		}
	}
}


/********************************************************************************
*
* Notice : This Program Can Be Launched In VC6.0 Environment
*
********************************************************************************/