【算法】希尔排序,快速排序,选择排序,插入排序,冒泡排序

头文件

/*
* @function: 冒泡排序
* @author: 成鹏致远
* @net: infodown.tap.cn
*/

#include "myinclude.h"

void bubble_sort(int n,int before[])
{
int i,j,temp;
for(i=0; i<n; i++)
{
for(j=0; j<n-i-1; j++)
{
if(before[j] > before[j+1])
{
temp = before[j+1];
before[j+1] = before[j];
before[j] = temp;
}
}
}

}