 Other sophisticated parallel sorting algorithms can achieve the same or better time bounds with a lower constant.For example, in 1991 David Powers described a parallelized quicksort (and a related radix sort) that can operate in "O"(log "n") time on a CRCW parallel random-access machine (PRAM) with "n" processors by performing partitioning implicitly.Powers further shows that a pipelined version of Batcher's Bitonic Mergesort at "O"((log "n")2) time on a butterfly sorting network is in practice actually faster than his "O"(log "n") sorts on a PRAM, and he provides detailed discussion of the hidden overheads in comparison, radix and parallel sorting.