insertSort 插入排序

插入排序类似于抓扑克牌

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <bitset>
#include <list>
#include <map>
#include <set>
#include <iterator>
#include <algorithm>
#include <functional>
#include <utility>
#include <sstream>
#include <climits>
#include <cassert>
#define BUG puts("here!!!");

using namespace std;
const int N = 50;
void insertSort(int a[], int len) {
    int i, j, temp;
    for(i = 1; i < len; i++) {// 新抓的每张扑克牌
        int temp = a[i];
        for(j = i-1; a[j] > temp && j >= 0; j--) {
            a[j+1] = a[j];
        }
        a[j+1] = temp;
    }
}
int main() {
    int a[] = {6, 8, 5, 9, 6, 2, 1};
    insertSort(a, 7);
    for(int i = 0; i < 7; i++) {
        cout << a[i] << ' ';
    }
    cout << endl;
    return 0;
}