冒泡排序(C++)
/*
Subject: Bubble sort
Author: shexinwei
Date: 2010-09-28
Laguage: C++
IDE | Tool: GCC(DEV 5.0)
Version: 1.0
Modify Time: 2010-09-28
*/
#include <cstdlib>
#include <iostream>
#include <fstream>
using namespace std;
//排序函數(shù)
int Bublle_sort(int data[],int n);
//打印數(shù)組函數(shù)
int print(int data[],int n);
int main(int argc, char *argv[])
{
int data[] = { 2,1,5,3,5,2,6,2};
int length = sizeof(data)/sizeof(data[0]);
cout<<"初始序列:"<<endl;
print(data,length);
Bublle_sort(data,length);
cout<<"最終結(jié)果:"<<endl;
print(data,length);
cout<<endl;
system("pause");
return 1;
}
int Bublle_sort(int data[],int n)
{
int tmp = 0;
for(int i = 0;i < n;i++)
{
for(int j = 0;j < n-i-1;j++)
{
if(data[j]<data[j+1])
{
tmp = data[j];
data[j] = data[j+1];
data[j+1] = tmp;
}
else continue;
}
cout<<i+1<<"次排序結(jié)果:"<<endl;
print(data,n);
cout<<endl;
}
return 1;
}
int print(int data[],int n)
{
for(int i = 0;i < n;i++)
{
cout<<data[i]<<" ";
}
cout<<endl;
}
調(diào)試結(jié)果:

Subject: Bubble sort
Author: shexinwei
Date: 2010-09-28
Laguage: C++
IDE | Tool: GCC(DEV 5.0)
Version: 1.0
Modify Time: 2010-09-28
*/
#include <cstdlib>
#include <iostream>
#include <fstream>
using namespace std;
//排序函數(shù)
int Bublle_sort(int data[],int n);
//打印數(shù)組函數(shù)
int print(int data[],int n);
int main(int argc, char *argv[])
{
int data[] = { 2,1,5,3,5,2,6,2};
int length = sizeof(data)/sizeof(data[0]);
cout<<"初始序列:"<<endl;
print(data,length);
Bublle_sort(data,length);
cout<<"最終結(jié)果:"<<endl;
print(data,length);
cout<<endl;
system("pause");
return 1;
}
int Bublle_sort(int data[],int n)
{
int tmp = 0;
for(int i = 0;i < n;i++)
{
for(int j = 0;j < n-i-1;j++)
{
if(data[j]<data[j+1])
{
tmp = data[j];
data[j] = data[j+1];
data[j+1] = tmp;
}
else continue;
}
cout<<i+1<<"次排序結(jié)果:"<<endl;
print(data,n);
cout<<endl;
}
return 1;
}
int print(int data[],int n)
{
for(int i = 0;i < n;i++)
{
cout<<data[i]<<" ";
}
cout<<endl;
}
調(diào)試結(jié)果:


