quicksort
divide and conquer sorting algorithm
Facts
10 properties- Subclass of
- sorting algorithm
- 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
- GitHub topic
- quicksort-algorithm
- 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
🔗 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