Big O complexity

Posted by Codenotguru on Stack Overflow See other posts from Stack Overflow or by Codenotguru
Published on 2010-04-12T19:59:14Z Indexed on 2010/04/12 20:02 UTC
Read the original article Hit count: 347

Filed under:
|

what is Big Oh notation mean and when an algorithm has logarithmic complexity?? for example how is quick sort O(nlogn)???

© Stack Overflow or respective owner

Related posts about complexity

Related posts about data-structures