@pescadomuerto: when it comes to time complexities, most of the time comparing the number of passes is meaningless. You're currently sort of saying that 3*n != n*3. That's why the asymptotic behavior is ignoring the constant factors.

Your solution goes over the set for each iteration of the for loop - this means in the worst case scenario it is O(n^2).

i got that.
thanks for the tips :D

Many people have suggested this, but it doesn't really do anything. It's just re-labeling and re-leveling the playing field. Newbies and people with bad taste will still do their thing, and they'll utilize the downvote button too so it's not like giving everyone more power will make wiser people more influencial.