[prev in list] [next in list] [prev in thread] [next in thread] 

List:       busybox
Subject:    Re: [BusyBox] Re: [PATCH] Re: Sigh... this time i attached the file
From:       Jörn Engel <joern () wohnheim ! fh-wedel ! de>
Date:       2003-10-27 11:14:19
[Download RAW message or body]

On Fri, 24 October 2003 23:37:59 -0500, Rob Landley wrote:
> On Friday 24 October 2003 21:40, Rob Landley wrote:
> 
> > > Can you send me your code?  I am not (yet) allowed to send you mine in
> > > return, but I can sure comment on it, after fixing my speed problem.
> >
> > Let me finish debugging it first.  Hopefully later this evening...
> 
> Ahem.
> 
> Sigh...
> 
> Okay, my numbers above were just completely wrong about the worst case 
> behavior, because I was using strncmp instead of memcmp and testing with a 
> cat of /dev/zero ad my worst case "everything's the same" scenario.
> 
> Hands up everybody who can spot what's wrong with this picture.

me! me! me! me! :)

> I'm going to go clean up the bit I/O functions or something instead.  This 
> sorting stuff is kind of annoying...

Correct.  $100 cash for someone that can sort *any* data in n*log(n)^2
or less.  Random data is trivial and Julian weaseled around one type
or worst case data.  Guess I have to weasel more and avoid all of them
in my redesign. :)

Jörn

-- 
Data dominates. If you've chosen the right data structures and organized
things well, the algorithms will almost always be self-evident. Data
structures, not algorithms, are central to programming.
-- Rob Pike
_______________________________________________
busybox mailing list
busybox@mail.busybox.net
http://codepoet.org/mailman/listinfo/busybox
[prev in list] [next in list] [prev in thread] [next in thread]