转载自:http://blog.csdn.net/wwttqq85538649/archive/2009/10/08/4643272.aspx
把数组中的n个元素由小到大进行排序
输入:数组的个数n,数组A【】
输出:按递增顺序排序的数组A【】
// bubble.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include"iomanip.h"
#include "iostream.h"
#define MAXSIZE 100
//交换两个元素的值
void swap(int &a,int &b)
{
int temp;
temp = a;
a = b;
b = temp;
}
//用冒泡法对数组进行排序
void bubble(int a[],int n)
{
int i,k;
for(k = n-1;k>0;k--)
{
for(i = 0;i < k;i++ )
{
if(a[i]>a[i+1])
swap(a[i],a[i+1]);
}
}
}
int main(int argc, char* argv[])
{
int a[MAXSIZE],n,i;
cout<<"please input the numbers of array"<<endl;
cin>>n;
cout<<"please input every value of element"<<endl;
for(i = 0;i < n;i++)
{
cout<<"please input the"<<setw(5)<<i<<setw(35)<<"element(enter Enter to switch):"<<endl;
cin>>a[i];
}
bubble(a,n);
for(i = 0;i < n;i++)
cout<<a[i]<<setw(8);
}