27 December 2016

Big-O Comparison

Usually it's easier to see in a graph the complexity of functions:



Source: https://discuss.leetcode.com/topic/23858/strange-o-nlogn-c-solution-with-qsort-takes-only-4ms/2



http://cooervo.github.io/Algorithms-DataStructures-BigONotation/big-O-notation.html

No comments:

Post a Comment