title: Calculate T(n)? Algorithm efficiency (Python)
body: <p>I get the whole Big "O" thing but I'm kinda confused on the whole "finding or calculating T(n)"</p>
  
  <p>Heres one problem with a sequential search.
  Instead of just giving me the answer please tell me how you got it</p>
  
  <pre><code>def sequentialSearch(alist, item):
      pos = 0
      found = False
  
      while pos &lt; len(alist) and not found:
          if alist[pos] == item:
              found = True
          else:
              pos = pos+1
      return found
  </code></pre>