jmcdonald-ut/scala-benchmarking — pull request #2 by jmcdonald-ut (2014-12-09 21:07:44+00:00)
Title: Quicksort

Quicksort With Futures
-----------------------------

This write makes it so quicksort now works with an arbitrary amount of futures/length of list. It also adds in code for printing out the time.

**General algorithm steps:**

1. Find pivots in list at evenly spread locations.
2. For each pivot initialize a list.
3. For each number in list to sort, put into first list where number is less than the pivot it is associated with.
4. Create futures for each pivot/list combo.
5. Create future that waits for other futures, and returns their combined results.
6. On success, merge lists together in order of pivot.