diff options
| author | Abigail <abigail@abigail.be> | 2005-10-13 03:25:10 +0200 |
|---|---|---|
| committer | Steve Peters <steve@fisharerojo.org> | 2005-10-12 23:28:04 +0000 |
| commit | e62b30224b43a0d71b586edde9c56a1f433e23cd (patch) | |
| tree | 80662c08c90ef509556ae2e15f26bd2f67f12363 /pp_sort.c | |
| parent | f26f4a2f8b63c72a33468ddeeb9d0337f0892af6 (diff) | |
| download | perl-e62b30224b43a0d71b586edde9c56a1f433e23cd.tar.gz | |
Typo in comment.
Message-ID: <20051012232509.GA1018@abigail.nl>
p4raw-id: //depot/perl@25743
Diffstat (limited to 'pp_sort.c')
| -rw-r--r-- | pp_sort.c | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -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). |