The simplest F# semicoroutines via seq. comprehensions http://en.wikipedia.org/wiki/Coroutine Replaced a custom function with the pipeline operator.
It's fairly straightforward in-place QuickSort implementation which uses ThreadPool for parallelization. Still slower than library function Array.sortInPlace, though.