Tag Archives: English

MIT Algorithms (1)

1)  f(n) = O(g(n))
    It means there are consts C > 0, n > 0 such that 0 <= f(n) <= c * g(n) for sufficiently large n.
    f(n) = Ω(g(n))
    It means there are consts C > 0, n > 0 such that 0 <= c * g(n) <= f(n) for sufficiently large n.
    
    O notation, less than or equal to.
    Ω notation, greater than or equal to.
    Θ notation, less than or equal to AND greate than or equal to.
2)  Macro convention
    A set in a formula represnts on anonymous function in that set.
    
3)  big O is upper bounds
O notation, less than or equal to.
Continue reading MIT Algorithms (1)