Top 10 Classics

• Simple sorting (select, bubble, insert)
• Sorting of recursive ideas (merge, fast)
• Ordering of bucket ideas (counting, cardinality, buckets)

1. Selection sort
2. Bubble sort
3. Insertion sort
4. Hill sorting
5. Merge sort
6. Quick sort
7. Count sorting
8. Radix sort
9. Bucket sort
10. Heap sort

recursive

Fibonacci sequence

Hannotta recursive algorithm

Tree (binary tree,)

• Before the order
• After the order
• In the sequence
• layer

The heap

An array of

The list

• List inversion

• If there is a ring