if i understand this correctly this O() stuff simply is a way of describing how an algorithm scales performance-wise.

for example:

O(n) means that 10 constraints will take 10 times longer to process than 1 constraint.

O(n*n) means that 10 constraints will take 100 times longer to process than 1 constraint.

i am not really a programmer or computer scientist so please correct me if i am wrong!