Quote:
if i understand this correctly this O() stuff simply is a way of describing how an algorithm scales performance-wise.
O(n) means that 10 constraints/contacts will take 10 times longer to process than 1 constraint/contact.
O(n*n) means that 10 constraints/contacts will take 100 times longer to process than 1 constraint/contact.
and so on. the worst algorithms are the ones which's performance scales exponentially.
i am not really a programmer or computer scientist so please correct me if i am wrong! 
Pretty close definition. Here's a better one (with some more details):
http://en.wikipedia.org/wiki/Big_O_notation
Never argue with an idiot. They drag you down to their level then beat you with experience
| 
