diff options
| author | Jarkko Hietaniemi <jhi@iki.fi> | 2000-09-01 02:22:24 +0000 |
|---|---|---|
| committer | Jarkko Hietaniemi <jhi@iki.fi> | 2000-09-01 02:22:24 +0000 |
| commit | e35355fc86a8d4cbceeb314ff2c3d1b0d61b07d0 (patch) | |
| tree | 99c6d8b6c5153574082d040bb2b080561bcbc8e8 /pod | |
| parent | c54b6e81416ce8f20db98839af85a182ed595bab (diff) | |
| download | perl-e35355fc86a8d4cbceeb314ff2c3d1b0d61b07d0.tar.gz | |
Retract the mergesort code, way too incompatible licensing
and copyrights.
p4raw-id: //depot/perl@6963
Diffstat (limited to 'pod')
| -rw-r--r-- | pod/perldelta.pod | 11 |
1 files changed, 0 insertions, 11 deletions
diff --git a/pod/perldelta.pod b/pod/perldelta.pod index 961ded3c86..d739204571 100644 --- a/pod/perldelta.pod +++ b/pod/perldelta.pod @@ -290,17 +290,6 @@ distribution. map() that changes the size of the list should now work faster. -=item * - -sort() has been changed to use mergesort internally as opposed to the -earlier quicksort. For very small lists this may result in slightly -slower sorting times, but in general the speedup should be at least 20%. -Additional bonuses are that the worst case behaviour of sort() is now -better (in computer science terms it now runs in time O(N log N), as -opposed to quicksorts Theta(N**2) worst-case run time behaviour), and -that sort() is now stable (meaning that elements with identical keys -will stay ordered as they were before the sort). - =back =head1 Installation and Configuration Improvements |