冒泡排序

#include <iostream>
#include <string>
using namespace std;

void sort(int *data,int n){
	int i,j,k;
	for(int i=0;i<n;i++){
		for(int j=0;j<n-i-1;j++){
			if(data[j]>data[j+1]){
				int temp = data[j];
				data[j] = data[j+1];
				data[j+1] = temp;
			}
		}
	}
}

int main(int argc, char *argv[])
{
	int data[] = {1,5,6,2,8,3,7};
	sort(data,7);
	for(int i=0;i<7;i++){
		cout<<data[i]<<endl;
	}
	cout<<"Hello C-Free!"<<endl;
	return 0;
}