Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

JUst wondering

Name: Anonymous 2012-03-23 8:45

Alright alright, do you guys even /know/ what is meant by 'qsort is O(n^3)' etc?

Name: Anonymous 2012-03-23 8:48

The worst you can do is O(clamp(2,2,2));

Name: Anonymous 2012-03-23 8:53

In case you guys care http://www.castleposer.co.uk/articles/maths_clamp.html

Name: Anonymous 2012-03-23 9:03

Yes. We're not as stupid and uneducated as we seem, dental toilet.

Name: Anonymous 2012-03-23 14:38

wow that's a mighty inefficient quicksort you got there

Name: Anonymous 2012-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.

Name: Anonymous 2012-03-23 14:47

>>6
Shut UP JEW!!!

Name: Anonymous 2012-03-23 16:07

I thought qsort was O(n log n)

Name: Anonymous 2012-03-23 18:47

>>8
The regular case, on general (random) inputs is O(nlogn). If the input is already sorted and/or you pick bad pivots, the worst case is O(n^2).

Newer Posts

JUst wondering

1 Name: Anonymous 2012-03-23 8:45

2 Name: Anonymous 2012-03-23 8:48

3 Name: Anonymous 2012-03-23 8:53

4 Name: Anonymous 2012-03-23 9:03

5 Name: Anonymous 2012-03-23 14:38

6 Name: Anonymous 2012-03-23 14:45

7 Name: Anonymous 2012-03-23 14:47

8 Name: Anonymous 2012-03-23 16:07

9 Name: Anonymous 2012-03-23 18:47