O'Reilly logo
  • Erik Johnson thinks this is interesting:

O(n)

From

Cover of Java Programming Interviews Exposed

Note

This is wrong, for binary search, performance is O(log n)