Not logged in
Log in now
Create an account
Subscribe to LWN
LWN.net Weekly Edition for May 23, 2013
An "enum" for Python 3
An unexpected perf feature
LWN.net Weekly Edition for May 16, 2013
A look at the PyPy 2.0 release
Or are usually slow but can be incredibly fast :-) Hence the need to know your data!
The sort you are thinking of is the quick sort - under most circumstances it's the fastest.
The one I'm thinking of is the bubble sort :-) The watermark-optimised version, run over a already-sorted input set, is provably the fastest sort possible! And this is also the quick-sort worst case!
I'm a regular user of the bubble sort and variants, but oftentimes I know my datasets are approximately sorted before I start.
Btrfs: broken file system design (was Unbound(?) internal fragmentation in Btrfs)
Posted Nov 10, 2010 7:48 UTC (Wed) by Blaisorblade (guest, #25465)
Copyright © 2013, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds