On Monday, 10 September 2007, at 17:17:21 (-0500), Jesse Luehrs wrote: > While it's true that bubble sort isn't ever going to be faster, > that's not just because it's always O(n^2). Insertion sort is also > O(n^2), but it does outperform quicksort on small data sets (under > 10 elements or so)... highly optimized sorting algorithms often use > quicksort to sort large data sets, but switch to insertion sort once > the partitions drop below a certain size, since it's faster. See > http://en.wikipedia.org/wiki/Insertion_sort for details.
True. I had forgotten that tidbit. Thanks! :) Michael -- Michael Jennings (a.k.a. KainX) http://www.kainx.org/ <[EMAIL PROTECTED]> Linux Server/Cluster Admin, LBL.gov Author, Eterm (www.eterm.org) ----------------------------------------------------------------------- "Sometimes I give myself the creeps. Sometimes my mind plays tricks on me. It all keeps adding up; I think I'm cracking up. Am I just paranoid? Am I just stoned?" -- Green Day, "Basket Case" ------------------------------------------------------------------------- This SF.net email is sponsored by: Microsoft Defy all challenges. Microsoft(R) Visual Studio 2005. http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ _______________________________________________ enlightenment-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/enlightenment-devel
