algorithm practice

Search Algorithms

1. Linear Search (O(n))
2. Binary Search (O(log n))
3. Interpolation Search (best: O(log log n), worst: O(n))
4. Jump Search (O(√n))
5. Fibonacci Search (O(log n))
6. Hash Search (ave: O(1), worst: O(n))
7. Block Search (O(√n))
8. B-tree Search (O(log n))
9. AVL Tree Search (O(log n))
10. Red-Black Tree Search (O(log n))
11. Breadth-First Search, BFS (O(V+E) v:node e:edge)
12. Depth-First Search, DFS (O(V+E) v:node e:edge)
13. Binary Search Tree, BST (best: O(log n), worst: O(n))