Split Quick Sort a Multi-Threaded Sort

This sort uses statistical analysis to find an ideal pivots. When an ideal pivot is found, the list is separated into two and half is given to a newly created thread. By keeping track of how many worker threads will be created, we reduce overhead and can get a fully sorted list quickly.