排序_Bubble_sort(冒泡排序)

冒泡排序,时间复杂度是O(n^2),但是它的有点也十分优越,那就是比较容易敲出来代码,而且相对稳定,是一种稳定的排序方法.

贴出代码:

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <string>
#define inf 0x3fffffff

using namespace std;

int N;

int a[1000];

void Bubble_sort ()
{
for (int i = 1 ; i < N ; i++)
{
for (int j = 0; j < N - 1; j++)
{
if (a[j] > a[j + 1])
{
int t = a[j];
a[j] = a[j + 1];
a[j + 1] = t;
}
}
}
}

int main()
{
cout << "Input the number that you want be sorted : " << endl;
cin >> N;
cout << "Input the numbers :" << endl;
for (int i = 0; i < N ; i++)
{
cin >> a[i];
}
Bubble_sort ();
for (int i = 0; i < N; i++)
{
cout << a[i] << " ";
}
cout << endl;
system ("pause");
return 0;
}