quicksort

Summary

quicksort is a comparison sort^[1]. quicksort draws 4,194 Wikipedia views per month (comparison_sort category, ranking #1 of 2).^[2]

Key Facts

• quicksort is credited with the discovery of Tony Hoare^[3].
• quicksort's instance of is recorded as comparison sort^[4].
• quicksort's instance of is recorded as divide-and-conquer algorithm^[5].
• quicksort's instance of is recorded as sorting algorithm^[6].
• quicksort is a type of sorting algorithm^[7].
• quicksort's Commons category is recorded as Quicksort^[8].
• quicksort's time of discovery or invention is recorded as 1961^[9].
• quicksort's described by source is recorded as Algorithm 64: Quicksort^[10].
• quicksort's Stack Exchange tag is recorded as https://stackoverflow.com/tags/quicksort^[11].
• quicksort's maintained by WikiProject is recorded as WikiProject Mathematics^[12].
• quicksort's P14541 is recorded as 20WQjY^[13].

Body

Designation and Status

Recorded instance of include comparison sort^[4], divide-and-conquer algorithm^[5], and sorting algorithm^[6].

Why It Matters

quicksort draws 4,194 Wikipedia views per month (comparison_sort category, ranking #1 of 2).^[2] quicksort has Wikipedia articles in 28 language editions, a strong signal of global cultural recognition.^[14] quicksort is known by 59 alternative names across languages and contexts.^[15]