Messages in this thread | | | From | Tobias Wollgam <> | Subject | Re: [RFC] 2.5.8 sort kernel tables | Date | Fri, 19 Apr 2002 17:16:25 +0200 |
| |
> On Fri, 19 Apr 2002, Jamie Lokier wrote: > > Since we're comparing sort algorithms, I am quite fond of Heapsort. > > Simple, no recursion or stack, and worst case O(n log n). It's not > > especially fast, but the worst case behaviour is nice:
There exist a variation of heapsort called clever heapsort (or bottom-up heapsort) that is a little bit faster for big arrays.
I don't know if it will be useful for the kernel. How big are the arrays?
Greetings,
Tobias
-- Tobias Wollgam * Softwaredevelopment * Business Unit Information MATERNA GmbH Information & Communications Vosskuhle 37 * 44141 Dortmund http://www.materna.de - 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/
| |