Messages in this thread | | | Date | Sat, 10 Mar 2001 19:50:06 +0100 | From | Martin Mares <> | Subject | Re: quicksort for linked list |
| |
Hello!
> Well, not really in this situation, after a simple modification. It is > trivial to show that using "shorter interval sorted first" approach one > can bound an amount of an extra memory, on stack or otherwise, and by a > rather small number.
By O(log N) which is in reality a small number :)
Have a nice fortnight -- Martin `MJ' Mares <mj@ucw.cz> <mj@suse.cz> http://atrey.karlin.mff.cuni.cz/~mj/ "Dijkstra probably hates me." -- /usr/src/linux/kernel/sched.c - 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/
| |