3 Mar
2004
3 Mar
'04
5:12 p.m.
Joel Young <jdy@cs.brown.edu> writes:
-------- From: Brian McNamara <lorgon@cc.gatech.edu>
Like any quicksort, it's O(N^2), but the constant-factor costs here are
nlog(n) ?
Average case: nlog(n) Worst case: n^2 http://www.cs.virginia.edu/~luebke/cs332.fall00/lecture6/tsld009.htm introsort is reliably nlog(n) -- Dave Abrahams Boost Consulting www.boost-consulting.com