title: Why is it impossible to find a specified value in a sorted array faster than O(log n)?
body: <p>I'm pretty new to computer science. In the closing to a lecture, my AP Computer Science teacher mentioned the comparison model for finding a specified value in a sorted array is <em>big omega (log n)</em> i.e. <strong>Ω(log n)</strong>, which as I understand it, means it’s impossible to accomplish this task any faster than <strong>O(log n)</strong>. Why is this?</p>