Date: Mon, 28 Sep 1998 18:15:01 -0400 (EDT)
Message-Id: <199809282215.SAA07470@indy.delorie.com>
From: DJ Delorie <dj AT delorie DOT com>
To: nate AT cartsys DOT com
CC: djgpp-workers AT delorie DOT com
In-reply-to: <361007E0.34452D89@cartsys.com> (message from Nate Eldredge on
	Mon, 28 Sep 1998 15:04:16 -0700)
Subject: Re: Much Improved Version of qsort
Precedence: bulk


> So it looks like the only BSD functions left are `random' and friends,
> and the time functions in ansi/time/ctime.c.  I'm not sure what of this
> is worth rewriting; in the first case, there is always `rand', and the
> time stuff looks rather complicated.

ctime.c is *very* complicated.  It took me a while to get it running
as is!

Random() isn't complicated, but the math is, and it would have to be
re-implemented from algorithms.  Anyone got a good description of the
random() algorithm, to post?  Then if someone else has time, they can
start on it.

Of course, a public domain (not gnu or bsd) version of either would be
helpful.