Algorithm

Snikolov-algorithm

Exponential backoff

Graph

  • Breadth-First Search (BFS)
    • Sortest Path
  • Depth-First Search (DFS)
    • all posible result
    • search on graph

String searching algorithms

  • Rabin-Karp
  • Boyer–Moore
  • Knuth–Morris–Pratt (KMP)

Complexity analysis (Time & Space)

Ref:

Asymptopic Notation:

  • Big-O/Big-Oh/Big-Omicron: no more than
  • Big-Omega: at least
  • Big-Theta: as much as (both Big-O and Big-Omega)

rate of growth = how fast a function grows with the input size

Complexity Table (best to worst):

  • constant (O(1))
  • logarithmic (O(log n))
  • polylogarithmic (O(log n ^ c))
  • linear (O(n))
  • n log-star n (O(n log * n))
  • linearthmic (O(n log n) O(log n!))
  • quadratic (O(n^2))
  • polynomial (O(n^c))
  • exponential (2^O(n))
  • factorial (O(n!))