插入排序

插入排序，按升序（降序将代码第17行改为

while(i >= 0 && a[i] < key) {

）

#include<iostream>
#include<string>
#include<cstring>
using namespace std;

/**
 * @desc Insertion sort
 * 
 * @date 3/28/2015 
 *
 */
void insertionSort(int *a) {
        int i = 0, key;
        for(int j = 1; j < 6; j++) {
                key = a[j];
                i = j - 1;
                while(i >= 0 && a[i] > key) {
                        a[i+1] = a[i];
                        i--;
                }
                a[i+1] = key;
        }
}

void main() {
        int array[6] = {5, 2, 4, 6, 1, 3};
        insertionSort(array);
        for(int i = 0; i < 6; i++)
                cout<<array[i]<<endl;
}