quicksort

divide and conquer sorting algorithm
Class type of: sorting algorithm Q486598

Facts

10 properties
Average space complexity
O(\log n)
Average time complexity
O(n \log n)
Best-case time complexity
O(n \log n)
Described by source
Algorithm 64: Quicksort[7]
Discoverer or inventor
Tony Hoare[3]
Time of discovery or invention
1961[6]
Worst-case space complexity
O(n)
Worst-case time complexity
O(n^2)
🏷️ Also known as
en quicksort en partition-exchange sort ar ترتيب سريع cs rychlé třídění cs quick sort cs rychlé řazení de Quick sort de Quick-Sort el Γρήγορη ταξινόμηση es ordenamiento rapido es ordenamiento rápido es Quick Sort fa مرتب ساز سریع fa الگوریتم مرتب سازی سریع fa کوییک سورت fa مرتب‌سازی سریع fa مرتب سازی سریع fi pikajärjestäminen fi pikalajittelu fi quicksort
🔖 Identifiers · 18
OpenAlex ID
C2778937211
Image (Wikimedia Commons)
Sorting quicksort anim.gif ↗
BabelNet ID
02623285n
Brilliant Wiki ID
quick-sort
Dictionary of Algorithms and Data Structures ID
quicksort
Encyclopedia of China (Third Edition) ID (2026)
20WQjY
Encyclopedia of China (Third Edition) old ID (2021)
94352
Freebase ID
/m/092crt
GitLab.com topic ID
quick+sort
JSTOR topic ID (archived)
q-sort
MathWorld ID
Quicksort
Show all 18 identifiers +6
Microsoft Academic ID (discontinued)
2778937211
PlanetMath ID
Quicksort
Quora topic ID
Quicksort
Rosetta Code page ID
Sorting_algorithms/Quicksort
Stack Exchange tag
stackoverflow.com
Zhihu topic ID
19644323

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Instance of 3
Created notable works 1
Discoverer or inventor 1
Maintained by WikiProject 1
Subclass of 1
← Based on 1
Press Enter · cited answer in seconds

Summary

quicksort is a comparison sort[1]. quicksort is a type of sorting algorithm[2].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). quicksort. Retrieved November 20, 2026, from https://4ort.xyz/entity/quicksort
MLA “quicksort.” 4ort.xyz Knowledge Graph, 4ort.xyz, 20 Nov. 2026, https://4ort.xyz/entity/quicksort.
BibTeX @misc{4ortxyz_quicksort_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{quicksort}}, year = {2026}, url = {https://4ort.xyz/entity/quicksort}, note = {Accessed: 2026-11-20}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): quicksort — https://4ort.xyz/entity/quicksort (retrieved 2026-11-20)

Canonical URL: https://4ort.xyz/entity/quicksort · Last refreshed:

Edit History

Rolling log of changes to this entity's Wikidata record. Values shown reflect the current state of each edited property — follow the history link to see the precise diff for any edit.

  1. 10w ago · VGMaintenanceBot bot · 2026-09-08 view diff on Wikidata ↗
    Instance of → comparison sort, divide-and-conquer algorithm, sorting algorithm
    Maintained by WikiProject → WikiProject Mathematics
    Subclass of → sorting algorithm
    Discoverer or inventor → Tony Hoare
    + 2 other properties edited (see Wikidata diff for full list)
    "Added qualifier: MediaWiki page ID: 560, Add qualifier to Rosetta Code page ID `Sorting_algorithms/Quicksort`"
Live feed via Wikidata EventStreams. New edits appear within minutes of being made on Wikidata.