计数排序

void countintSort(int array[], int n) {
    int count[maxSize] = {0};

    int i;
    for (i = 0; i < n; ++i) {
        ++count[array[i]];
    }

    int counter = 0;
    for (i = 0; i < maxSize; ++i) {
        while (count[i]--) {
            array[counter++] = i;
        }
    }
}
//若array数组中含负数，可通过偏移的方式来避免数组越界