Big O and Little o

Posted by hyperdude on Stack Overflow See other posts from Stack Overflow or by hyperdude
Published on 2010-05-08T04:45:24Z Indexed on 2010/05/08 4:48 UTC
Read the original article Hit count: 247

Filed under:

If algorithm A has complexity O(n) and algorithm B has complexity o(n^2), what, if anything, can we say about the relationship between A and B? Note: the complexity of A is expressed using big-Oh, and the complexity of B is expressed using little-Oh.

© Stack Overflow or respective owner

Related posts about big-o