933yee's Notes
  • Home
  • Archives
  • Categories
  • Tags
  • About

Time Complexity

Big-O ($O$)Definition f(n) = $O$(g(n)) iff $\exists$ c, n0 > 0 such that f(n)$\le$ c $\cdot$ g(n) $\forall$ n $\ge$ n0 Examples 3n+2 = $O$(n)When c=4, n0 = 2, 3n+2 $\le$
2023-01-17
Algorithm > Time Complexity
#Algorithm #Time Complexity
1…567

Search

Hexo Fluid