zoukankan      html  css  js  c++  java
  • bubble

    #include <iostream>
    #include <algorithm>
    using namespace std;
    //冒泡排序
    void print(int* a, int n){
            for(int i=0; i<n; i++){
                    cout << a[i] << ' ';
            }
            cout << endl;
    }

    void sort(int* a, int n){
            for(int i=0; i<n-1; i++){
                    bool flag = true;
                    for(int j=0; j<n-i-1; j++){
                            if(a[j]>a[j+1]){
                                    swap(a[j],a[j+1]);
            /*
                                    int k = a[j];
                                    a[j] = a[j+1];
                                    a[j+1] = k;
            */
                                    flag = false;  
                            }
                    }
                    cout << "第" << i << "次:";
                    print(a, 10);
                    if(flag) break;
            }
    }

    int main()
    {
            int a[] = {9,0,1,3,2,5,6,4,7,8};
            //int a[] = {9,8,7,6,5,4,3,2,1,0};
            cout << "排序前:";
            print(a, 10);
            sort(a,10);
            cout << "排序后:";
            print(a,10);
    }

     

  • 相关阅读:
    DHCP Option 60 的理解
    几种开源分词工具的比較
    推荐交互设计师阅读的一本书
    iOS IAP教程
    艰苦的RAW格式数据恢复之旅
    BestCoder Round #11 (Div. 2) 前三题题解
    罗马数字
    mysql 加入列,改动列,删除列。
    杂项:ASP.NET Web API
    杂项:Web API
  • 原文地址:https://www.cnblogs.com/xiaomaogong/p/3040080.html
Copyright © 2011-2022 走看看