Its second step is referred to as the partition function, which divides the original list into elements that are higher or lower than a given pivot value.
Unlike similar procedures, a parallel version of this algorithm requires no synchronization, and requires big-O of n time given big-theta of n processors. Combining this algorithm, which was originally developed by C.A.R Hoare, with heapsort gives introsort, which is faster on average because heapsort has a better worst-case runtime. Its second step is referred to as the partition function, which divides the original list into elements that are higher or lower than a given pivot value. FTP, name this algorithm that runs in big-O of n log n time, that sorts a list by repeatedly creating two sub- lists and resorting, named for its speed.
Unlike similar procedures, a parallel version of this algorithm requires no synchronization, and requires big-O of n time given big-theta of n processors.
{Quicksort}