C++ implementation of the Pigeonhole sorting algorithm using plain arrays.
The primary array is randomly generated, both array size and maximum values can be adjusted via global variables. The auxiliary array is allocated dynamically.
I've included execution time measurement in the code, thus the program outputs its execution time (excluding the time it needs to generate and allocate the arrays).
