History log of /original-bsd/lib/libc/stdlib/heapsort.c (Results 1 – 9 of 9)
Revision Date Author Comments
# 82f2451b 04-Jun-1993 bostic <bostic@65305748-3e16-e211-a854-8c89a5c6f760>

4.4BSD snapshot (revision 8.1); add 1993 to copyright


# 246b03e1 12-Nov-1991 bostic <bostic@65305748-3e16-e211-a854-8c89a5c6f760>

make Reiser cpp happy


# d89af2b7 27-Sep-1991 bostic <bostic@65305748-3e16-e211-a854-8c89a5c6f760>

KNF patrol


# f4ba51bb 27-Sep-1991 elan <elan@65305748-3e16-e211-a854-8c89a5c6f760>

Changed macros so that all the arguments in them are passed by the
calling procedure. Also renamed the vaiables to make the code more
readable.


# 016bf9d1 23-Sep-1991 bostic <bostic@65305748-3e16-e211-a854-8c89a5c6f760>

fix copyright header


# 3ceef6d5 23-Sep-1991 bostic <bostic@65305748-3e16-e211-a854-8c89a5c6f760>

minor cleanups by Elan and I.


# 087ee694 06-Aug-1991 elan <elan@65305748-3e16-e211-a854-8c89a5c6f760>

Algorithm changed to cut down on number of calls to comparison fn.
This change is motivated by Knuth, Vol. 3, p. 158, problem 18.
The savings in time are on the order of about 20 % for 100000 rando

Algorithm changed to cut down on number of calls to comparison fn.
This change is motivated by Knuth, Vol. 3, p. 158, problem 18.
The savings in time are on the order of about 20 % for 100000 random elements.
In addition to this change various details were changed to make the program
more efficient such as assigning rather than swapping blocks of data.

show more ...


# 99b71b60 22-Jul-1991 bostic <bostic@65305748-3e16-e211-a854-8c89a5c6f760>

add contrib notice


# 0c6df9e4 04-Jun-1991 bostic <bostic@65305748-3e16-e211-a854-8c89a5c6f760>

date and time created 91/06/04 10:17:06 by bostic