冒泡排序，选择排序，插入排序

#include <iostream.h>

void main()

{

int arr[5] = {7,1,5,4,8};

//--------------------------------------------------------------------------

//bubble sort

/*

for(int i=0; i<4; i++)

{

for(int j=i+1; j<5; j++)

{

if(arr[i] > arr[j])

{

int k=arr[i];

arr[i] = arr[j];

arr[j] = k;

}

}

}

*/

//--------------------------------------------------------------------------

//select sort

/*for(int i=0; i<4; i++)

{

int k = arr[i];

int id = i;

for(int j=i+1; j<5; j++)

{

if(k > arr[j])

{

k = arr[j];

id = j;

}

}

if(k != arr[i])

{

arr[id] = arr[i];

arr[i] = k;

}

}

*/

//--------------------------------------------------------------------------

//insert sort

for(int i=1; i<5; i++)

{

int inserter = arr[i]; //插入元素

int index = i-1;

while(index>=0 && inserter<arr[index])

{

arr[index+1] = arr[index];

index --;

}

arr[index+1] = inserter;

}

//--------------------------------------------------------------------------

//output result

for(int i=0; i<5; i++)

{

cout << arr[i];

}

cout << endl;

}