From: Abigail <abigail@abigail.be>
Date: Thu, 13 Oct 2005 01:25:10 +0000 (+0200)
Subject: Typo in comment.
X-Git-Url: http://git.shadowcat.co.uk/gitweb/gitweb.cgi?a=commitdiff_plain;h=e62b30224b43a0d71b586edde9c56a1f433e23cd;p=p5sagit%2Fp5-mst-13.2.git

Typo in comment.
Message-ID: <20051012232509.GA1018@abigail.nl>

p4raw-id: //depot/perl@25743
---

diff --git a/pp_sort.c b/pp_sort.c
index 9592edb..2bd2c80 100644
--- a/pp_sort.c
+++ b/pp_sort.c
@@ -269,7 +269,7 @@ dynprep(pTHX_ gptr *list1, gptr *list2, size_t nmemb, SVCOMPARE_t cmp)
  * problem is subdivided into smaller and smaller parts, the parts
  * fit into smaller (and faster) caches.  So it doesn't matter how
  * many levels of cache exist, quicksort will "find" them, and,
- * as long as smaller is faster, take advanatge of them.
+ * as long as smaller is faster, take advantage of them.
  *
  * By contrast, consider how the original mergesort algorithm worked.
  * Suppose we have five runs (each typically of length 2 after dynprep).