title: Sets python worst case complexity
body: <p>The following operation on sets in python : <code>x in s</code> ; where s is a set, has</p>
  
  <p>Average case: O(1), and Worst Case: O(n)</p>
  
  <p>Can someone explain these complexities ?</p>