Function quick_sort

test/source/thread_sanitizer/quick_sort.cpp:87–98

algorithm quicksort(A, lo, hi) is if lo < hi then p := partition(A, lo, hi) quicksort(A, lo, p) quicksort(A, p + 1, hi) */

*/
result<void> quick_sort(executor_tag, std::shared_ptr<thread_pool_executor> tp, int* a, int lo, int hi) {
    if (lo >= hi) {
        co_return;
    }

    const auto p = partition(a, lo, hi);
    auto res0 = quick_sort({}, tp, a, lo, p);
    auto res1 = quick_sort({}, tp, a, p + 1, hi);

    co_await res0;
    co_await res1;
}