Start the project and read the contents of the "out:" list It will instruct you
A decently fast sorting algorithm, going by the name "introsort". It's a Heap-, Insertion & Quicksort hybrid, combining the best-case scenarios. This implementation is loosely based around the c++ standard template library's implementation (std::sort). Speed: On my machine, it's running quite fast, with it being a bit faster than the commonly used implementation here on scratch. Since its using a median of 3 strategy to find a good pivot. The Heap- and Introsort can probably be optimized a bit more to shave off some comparisons etc... . I also saw that @-rex- had a few more things to determine an even better pivot in certain scenarios. Im pretty tired for now though and ill leave it like it is for now.
