People often use big-O (asymptotically bounded above) when they really want big-Θ (theta, asymptotically bounded above and below). Strictly by the definition, for instance, binary search is O(e^x), as well as O(x^12), O(x), and O(lg x). However, binary search is Θ(lg x), and not Θ(any of those other functions).