Wiki › Technique
Quicksort
Article
ReadAll pages
From Chaipat's knowledge graph
No article has been written for this page yet; it is generated from the knowledge graph.
About Quicksort · from Wikipedia
Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in 1961. It is still a commonly used algorithm for sorting. Overall, it is slightly faster than merge sort and heapsort for randomized data, particularly on larger distributions.
Summary from Wikipedia ↗, CC BY-SA 4.0.
Related work
- thealgorithm Jan 2025
Sorting: heap sort and quicksort. Hashing: MD2, SHA-1 and SHA-2, implemented from their specifications.