Alright alright, do you guys even /know/ what is meant by 'qsort is O(n^3)' etc?
Name:
Anonymous2012-03-23 14:45
The time complexity of a qsort function with a number of inputs n is n^3. This means that there exists a constant integer c, such that for all n, f(n) <= cf(n).
Better get back to work. That toilet won't scrub itself.