Time complexity : $O(n^2)$
Time complexity : $O(n\space logn)$
▶ Merge Sort
▶ Quick Sort
▶ Heap Sort
Linear time
▶ Counting Sort
▶ Radix Sort
▶ Bucket Sort
▶ Hash Table
▶ Binary Search Tree
▶ B-Tree
▶ B+ Tree
▶ 2-3-4 Tree
▶ Red-black Tree
▶ AVL Tree
▶ Naive Algorithm
▶ KMP(Knuth–Morris–Pratt) Algorithm
▶ BM(Boyer–Moore) Algorithm
▶ Horspool Algorithm