#include <iostream>
using namespace std;
#define siz 1000
int a[siz],n;
void bubbleSort(int a[], int n){
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
if(a[i]>a[j]){
int temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
for(int i=0;i<n;i++) cout<<a[i]<<" ";
cout<<endl;
}
int main()
{
while(cin>>n){
for(int i=0;i<n;i++) cin>>a[i];
bubbleSort(a,n);
}
return 0;
}
Friday, November 2, 2012
Bubble Sort
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment