title: Trying to understand Big-oh notation
body: <p>Hi I would really appreciate some help with Big-O notation. I have an exam in it tomorrow and while I can define what f(x) is O(g(x)) is, I can't say I thoroughly understand it.</p>
  <p>The following question ALWAYS comes up on the exam and I really need to try and figure it out, the first part seems easy (I think) Do you just pick a value for n, compute them all on a claculator and put them in order? This seems to easy though so I'm not sure. I'm finding it very hard to find examples online.</p>
  <blockquote>
  <p>From lowest to highest, what is the
  correct order of the complexities
  O(n2), O(log2 n), O(1), O(2n), O(n!),
  O(n log2 n)?</p>
  <p>What is the
  worst-case computational-complexity of
  the Binary Search algorithm on an
  ordered list of length n = 2k?</p>
  </blockquote>