|
|
|
| more useful options | |
| PerlMonks |
Re: Re: about Coolness, Impatience and Complexityby runrig (Abbot) |
| on Jul 15, 2001 at 21:20 UTC ( [id://96868]=note: print w/replies, xml ) | Need Help?? |
|
Cool, I never actually realized that about Q::S, having only
read bits of code using it and not actually reading much about it.
So this means sorting could be an O(N) operation (not necessarily using Q::S, but maybe Quantum::Sort??).
In Section
Meditations
|
|
||||||||||||||||||||||