title: parallel quicksort boost::thread
body: <p>I wrote an in-place implementation of the quicksort algorithm and it performed beautifully (0.8ms for 1024 elements). I figured I could make it perform even faster if I implemented it on multiple threads so I tried using boost::thread and the list sorted perfectly but it took 1500 times longer than my sequential version (1539.3ms). I tried limiting the number of threads to various numbers but nothing seemed to make it as fast as the original version. Any reason why this seems to be the case? Has anybody successfully implemented a parallel in-place quicksort?</p>