mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-28 11:46:29 +08:00
29 lines
948 B
Markdown
29 lines
948 B
Markdown
|
---
|
||
|
|
comments: true
|
||
|
|
icon: material/sort-ascending
|
||
|
|
---
|
||
|
|
|
||
|
|
# Chapter 11. Sorting
|
||
|
|
|
||
|
|
{ class="cover-image" }
|
||
|
|
|
||
|
|
!!! abstract
|
||
|
|
|
||
|
|
Sorting is like a magical key that turns chaos into order, enabling us to understand and handle data in a more efficient manner.
|
||
|
|
|
||
|
|
Whether it's simple ascending order or complex categorical arrangements, sorting reveals the harmonious beauty of data.
|
||
|
|
|
||
|
|
## Chapter contents
|
||
|
|
|
||
|
|
- [11.1 Sorting algorithms](sorting_algorithm.md)
|
||
|
|
- [11.2 Selection sort](selection_sort.md)
|
||
|
|
- [11.3 Bubble sort](bubble_sort.md)
|
||
|
|
- [11.4 Insertion sort](insertion_sort.md)
|
||
|
|
- [11.5 Quick sort](quick_sort.md)
|
||
|
|
- [11.6 Merge sort](merge_sort.md)
|
||
|
|
- [11.7 Heap sort](heap_sort.md)
|
||
|
|
- [11.8 Bucket sort](bucket_sort.md)
|
||
|
|
- [11.9 Counting sort](counting_sort.md)
|
||
|
|
- [11.10 Radix sort](radix_sort.md)
|
||
|
|
- [11.11 Summary](summary.md)
|