Showing posts with label big o notation. Show all posts
Showing posts with label big o notation. Show all posts
19 August 2009
Big Ohh.
Did you know that if you replace an some code that (1) is frequently executed, (2) runs over a large data-set, and (3) implements an O(n^2) algorithm with some code that is implemented in terms of an O(n) algorithm that things will go quite a bit faster!? Yessirree, it is true!
Labels:
algorithm,
analysis,
big o notation,
computer science
Subscribe to:
Posts (Atom)