Analysis of algorithms (complexity)

Posted by Yktula on Stack Overflow See other posts from Stack Overflow or by Yktula
Published on 2010-04-22T22:51:25Z Indexed on 2010/04/22 22:53 UTC
Read the original article Hit count: 295

How are algorithms analyzed? What makes quicksort have an O(n^2) worst-case performance while merge sort has an O(n log(n)) worst-case performance?

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about analysis