title: Which performance have cPython sets in comparison to lists?
body: <p>I have just found these <a href="http://effbot.org/zone/python-list.htm#performance" rel="nofollow">performance notes for cPython lists</a>:</p>
  
  <p>Time needed for python lists to ....</p>
  
  <ul>
  <li>... get or set an individual item: O(1)</li>
  <li>... append an item to the list: worst O(n^2), but usually O(1)</li>
  <li>... insert an item: O(n), where n is the number of elements after the inserted one</li>
  <li>... remove an item: O(n)</li>
  </ul>
  
  <p>Now I would like to know the same performance characteristics for cPython sets. Also, I would like how fast iteration over the list / set is. I am especially interested in large lists / sets.</p>