diff options
| author | Jarkko Hietaniemi <jhi@iki.fi> | 2002-01-06 20:51:32 +0000 |
|---|---|---|
| committer | Jarkko Hietaniemi <jhi@iki.fi> | 2002-01-06 20:51:32 +0000 |
| commit | 3ed2713bcb3cb6681d5638a8603a8427e2a4ac96 (patch) | |
| tree | 32fca6641dd41952b80ca4098464b5e38c81a1a0 /lib | |
| parent | 25596c822ec76c369036d51b5e91fcdfb4acdb05 (diff) | |
| download | perl-3ed2713bcb3cb6681d5638a8603a8427e2a4ac96.tar.gz | |
No need to overqualify.
p4raw-id: //depot/perl@14109
Diffstat (limited to 'lib')
| -rw-r--r-- | lib/sort.pm | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/sort.pm b/lib/sort.pm index 18f3606e27..6568c5f2d9 100644 --- a/lib/sort.pm +++ b/lib/sort.pm @@ -77,7 +77,7 @@ quicksort defends against quadratic behaviour by shuffling large arrays before sorting. A stable sort means that for records that compare equal, the original -input ordering is preserved. Perl's mergesort is stable, quicksort is not. +input ordering is preserved. mergesort is stable, quicksort is not. Stability will matter only if elements that compare equal can be distinguished in some other way. That means that simple numerical and lexical sorts do not profit from stability, since equal elements |