void QuickSortTernaryLL(SortArray& A, size_t lo, size_t hi) { if (lo + 1 < hi) { std::pair<ssize_t,ssize_t> mid = PartitionTernaryLL(A, lo, hi); QuickSortTernaryLL(A, lo, mid.first); QuickSortTernaryLL(A, mid.second, hi); } }
void QuickSortTernaryLL(WSortView& a, size_t lo, size_t hi) { if (lo + 1 < hi) { std::pair<ssize_t,ssize_t> mid = PartitionTernaryLL(a, lo, hi); QuickSortTernaryLL(a, lo, mid.first); QuickSortTernaryLL(a, mid.second, hi); } }
void QuickSortTernaryLL(SortArray& A) { return QuickSortTernaryLL(A, 0, A.size()); }
void QuickSortTernaryLL(WSortView& a) { return QuickSortTernaryLL(a, 0, a.size()); }