On Tue, 17 Apr 2007, Nick Piggin wrote: > To be clear, I'm not saying O(logN) itself is a big problem. Type > > plot [10:100] x with lines, log(x) with lines, 1 with lines
Haha, Nick, I know how a log() looks like :) The Time Ring I posted as example (that nothing is other than a ring-based bucket sort), keeps O(1) if you can concede some timer clustering. - Davide - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to [EMAIL PROTECTED] More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/