![]() | |||||||||||||
Messages in this thread |
On Thu, Apr 18, 2002 at 03:20:17PM -0500, Oliver Xymoron wrote: > On Thu, 18 Apr 2002, William Lee Irwin III wrote: >> On Thu, Apr 18, 2002 at 07:46:26PM +1000, Keith Owens wrote: >>> The use of __init and __exit sections breaks the assumption that >>> tables such as __ex_table are sorted, it has already broken the >>> dbe table in mips on 2.5. This patch against 2.5.8 adds a generic >>> sort routine and sorts the i386 exception table. This sorting >>> needs to be extended to several other tables, to all >>> architectures, to modutils (insmod loads some of these tables for >>> modules) and back ported to 2.4. Before I spend the rest of the >>> time, any objections? >> It doesn't have to be an O(n lg(n)) method but could you use >> something besides bubblesort? Insertion sort, selection sort, >> etc. are just as easy and they don't have the horrific stigma of >> being "the worst sorting algorithm ever" etc. > Combsort is a trivial modification of bubblesort that's O(n log(n)). > http://cs.clackamas.cc.or.us/molatore/cs260Spr01/combsort.htm > Though we should probably just stick a simple qsort in the library > somewhere. but isn't qsort's worst case behaviour for an already sorted list? i cant remember how bad it is but i thought it was like O(n^2) for worst case, ie just as bad as bubble sort.. matt - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/ | ||||||||||||
| Last update: 2005-03-22 12:25 [from the cache] ©2003-2008 | |||||||||||||