冒泡排序

冒泡排序就是相邻关键字两两比较，一次排序后最大的关键字在末尾，是一种稳定的排序方法，时间复杂度是$O(n^2)$。

C++实现基本冒泡排序：

#include<iostream>
using namespace std;
void sort_maopao(int a[],int n) {
    int temp;
    for (int i = 0;i< n-1;++i) {
        for (int j = 0;j< n-1-i;++j) {
            if (a[j] > a[j+1]) {
                temp = a[j];
                a[j] = a[j+1];
                a[j+1] = temp;
            }
        }
    }    
}
int main(){
    int a[6] = {5,8,9,2,7,6};
    sort_maopao(a,6);
    for (int m = 0;m < 6;++m) {
        cout << a[m] << endl;
    }
} 

C++优化基本冒泡排序1：

#include<iostream>
using namespace std;
/* 用一个标志位进行记录 */
void sort_maopao(int a[],int n) {
    int temp;
    for (int i = 0;i< n-1;++i) {
        bool flag = true;
        for (int j = 0;j< n-1-i;++j) {
            if (a[j] > a[j+1]) {
                temp = a[j];
                a[j] = a[j+1];
                a[j+1] = temp;
                flag = false;
            }
        }
    if (flag == true) {
        break;
    }
    }    
}
int main() {
    int a[6] = {5,8,9,2,7,6};
    sort_maopao(a,6);
    for (int m = 0;m < 6;++m) {
        cout << a[m] << endl;
    }
} 

C++优化基本冒泡排序2：

#include<iostream>
using namespace std;
/* 记录上一次最后交换的位置来 作为下一次的比较参数 */
void sort_maopao(int a[],int n) {
    int temp;
    int re = n-1; 
    int b;
    for (int i = 0;i< n-1;++i) {
        bool flag = true;
        for (int j = 0;j< re;++j) {
            if (a[j] > a[j+1]) {
                temp = a[j];
                a[j] = a[j+1];
                a[j+1] = temp;
                flag = false;
                b = j;
            }
        }
        re = b;
        if (flag == true) { 
            break;
        }
    }    
}

python实现基本冒泡排序：

def sort_maopao(maopao_list,n):
    for i in range(n):
        for j in range(n-1-i):
            if maopao_list[j] > maopao_list[j+1]:
                maopao_list[j],maopao_list[j+1] = maopao_list[j+1],maopao_list[j]
maopao_list = [5,8,9,2,7,6]
sort_maopao(maopao_list,len(maopao_list))
print(maopao_list)

python优化基本冒泡排序：

def sort_maopao(maopao_list,n):
    for i in range(n):
        flag = True        # 加个标志位
        for j in range(n-1-i):
            if maopao_list[j] > maopao_list[j+1]:
                maopao_list[j],maopao_list[j+1] = maopao_list[j+1],maopao_list[j]
                flag = False
        if flag == True:
            break
maopao_list = [5,8,9,2,7,6]
sort_maopao(maopao_list,len(maopao_list))
print(maopao_list)

python优化基本冒泡排序2：

def sort_maopao(maopao_list,n):
    re = n-1
    for i in range(n):
        flag = True
        for j in range(re):
            if maopao_list[j] > maopao_list[j+1]:
                maopao_list[j],maopao_list[j+1] = maopao_list[j+1],maopao_list[j]
                flag = False
                b = j
        if flag == True:
            break
        re = b 
if __name__ == '__main__':
    maopao_list = [5,8,9,2,7,6]
    sort_maopao(maopao_list,len(maopao_list))
    print(maopao_list)