|
|
Boost : |
From: Joel Young (jdy_at_[hidden])
Date: 2004-03-03 10:50:23
--------
From: Brian McNamara <lorgon_at_[hidden]>
> Like any quicksort, it's O(N^2), but the constant-factor costs here are
nlog(n) ?
Joel
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk