diff options
| author | Artur Bergman <sky@nanisky.com> | 2001-08-23 11:45:59 +0000 |
|---|---|---|
| committer | Artur Bergman <sky@nanisky.com> | 2001-08-23 11:45:59 +0000 |
| commit | f8620f40b7cfcb15ec0e1f5b65ee5854b02c13fa (patch) | |
| tree | 5a0364aa2b75ca2977c0d279bc2948319ca73dc1 /pod/perlfaq4.pod | |
| parent | b8d2732ab3df9e2b9faffae11f8bca2e14b66c79 (diff) | |
| download | perl-f8620f40b7cfcb15ec0e1f5b65ee5854b02c13fa.tar.gz | |
Removed toy from 17133 after Matt Sargeants request.
p4raw-id: //depot/perl@11734
Diffstat (limited to 'pod/perlfaq4.pod')
| -rw-r--r-- | pod/perlfaq4.pod | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/pod/perlfaq4.pod b/pod/perlfaq4.pod index ff96afd262..826d793a71 100644 --- a/pod/perlfaq4.pod +++ b/pod/perlfaq4.pod @@ -1295,7 +1295,7 @@ Unfortunately, this algorithm is very inefficient. The Algorithm::Permute module from CPAN runs at least an order of magnitude faster. If you don't have a C compiler (or a binary distribution of Algorithm::Permute), then you can use List::Permutor which is written in pure Perl, and is still -several times faster than the toy algorithm above. +several times faster than the algorithm above. =head2 How do I sort an array by (anything)? |