#
50789 |
| 06-Aug-1991 |
elan |
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 ...
|