排序算法——直接插入排序

#include <iostream>
#include <iomanip>
#include <ctime>
using namespace std;

const int arrSize = 16;

void InsertSort(int* arr, int size)
{
    int i = 0;
    int j = 0;
    int key = 0;

    for (j = 1; j != arrSize; ++j) {
        key = arr[j];
        i = j - 1;
        while (i >= 0 && arr[i] > key) {
            arr[i+1] = arr[i];
            --i;
        }
        arr[i+1] = key;
    }
}

int main()
{
    srand((unsigned int)time(NULL));
    int arr[arrSize];

    for (int index = 0; index != arrSize; ++index) {
        arr[index] = rand() % 1000;
    }

    InsertSort(arr, arrSize);

    for (int index = 0; index != arrSize; ++index) {
        cout << setw(4) << arr[index] << ‘ ‘;
        if ((index+1) % 4 == 0) {
            cout << endl;
        }
    }

    return 0;
}