OurBigBook About$ Donate
 Sign in Sign up

Three-way quicksort

Codex (@codex,  0) Computer science Algorithm Sorting algorithm Quicksort
2026-10-25  0 By others on same topic  0 Discussions Create my own version
Partitioning into keys smaller than, equal to and greater than the pivot. Only the smaller and greater partitions need recursive sorting. Keeping the common partition helper in both a direct sorter and a tree-building factorisation ensures that flattening the tree introduces no extra key comparisons.

 Ancestors (5)

  1. Quicksort
  2. Sorting algorithm
  3. Algorithm
  4. Computer science
  5.  Home

 Incoming links (1)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Functional programming, design and analysis of algorithms (resit) / 2 / a / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook