title: HashSet look-up complexity?
body: <p>A look-up operation OR <code>contains</code> for single can be <code>O(n)</code> in worst-case right ? So, for <code>n</code> elements look up in <code>hashSet</code> will be <code>O(n^2)</code>?</p>