From 3ed2713bcb3cb6681d5638a8603a8427e2a4ac96 Mon Sep 17 00:00:00 2001 From: Jarkko Hietaniemi Date: Sun, 6 Jan 2002 20:51:32 +0000 Subject: [PATCH] No need to overqualify. p4raw-id: //depot/perl@14109 --- lib/sort.pm | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lib/sort.pm b/lib/sort.pm index 18f3606..6568c5f 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 -- 1.8.3.1