andré's sorting

#include <iostream>
#include <cstring>
#include <vector>

using namespace std;

/**
 * Orders an array of positive integers with a time complexity of N
 * Each of the integer must be less than 1123456 (around 1 million).
 * Integers must be different.
 *
 * @author André Souza Abreu
 * @param array An array of integers, passed by reference.
 * @param int The size of the aray
 * @param bool The sorting direction. false => ascending, true => descending.
 * @return void
*/
void andre_sort(int array[], int array_length, bool descending_sort = false) {
    // get the size of the
    int max_size = -1;
    for (int i = 0; i < array_length; i++) {
        if (array[i] > max_size) {
            max_size = array[i];
        }
    }
    max_size++; // increment by 1 because array index starts from zero

    // register the values
    int blueprint[max_size];
    for (int i = 0; i < max_size; i++) {
        blueprint[i] = 0;
    }

    //
    for (int i = 0; i < array_length; i++) {
        int value = array[i];
        blueprint[value]++;
    }

    //
    int index = 0;
    for (int i = 0; i < max_size; i++) {
        int j = i;

        if (descending_sort) {
            j = max_size - i - 1;
        }

        if (blueprint[j] != 0) {
            while (blueprint[j] != 0) {
                array[index] = j;
                index++;
                blueprint[j]--;
            }
        }
    }
}

int main () {
    int numbers[8];
    numbers[0] = 12;
    numbers[1] = 754;
    numbers[2] = 76;
    numbers[3] = 4123;
    numbers[4] = 230;
    numbers[5] = 754;
    numbers[6] = 43;
    numbers[7] = 754;

    andre_sort(numbers, 8);

    for (int i = 0; i < 8; i++) {
        int number = numbers[i];
        cout << number << endl;
    }
}