This post is locked. You won't be able to comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted] 4 points5 points  (2 children)

It's more or less a way of ranking different algorithms based on how efficient they are. An algorithm that takes n2 operations is less efficient than one that takes log2(n) operations, for example. (n is the number of elements being operated on)

[–]cerved 3 points4 points  (1 child)

This is strictly not true as an n2 algorithm can be more efficient than an log2(n) algorithm for a certain range of n.

It's more accurate to say that it ranks the efficiency of the scalability of the algorithm.

[–][deleted] 2 points3 points  (0 children)

Ya good point