title: ArrayList Get Operation O(1). How?
body: <p>In one of the <a href="https://stackoverflow.com/questions/ask">stack overflow answers</a> as to why ArrayList.get is O(1) and not O(n)</p>
  
  <p>The responder said that ArrayList was backed by an array and a </p>
  
  <pre><code>      RangeCheck(index); 
  </code></pre>
  
  <p>is what determined the constant time complexity instead of linear! I'm trying to wrap my head around this, won't ANY array have to at least a partial search  over perhaps a %age of n fields in an array thus constituting somehow an O(n) search ( if the element being hunted for is in the n-1 position of the array - wont this be an O(n) search? Its still a one level for loop which I thought was O(n) complexity?</p>