Suffix tree: Difference between revisions

Content added Content deleted
mNo edit summary
(→‎{{header|Perl 6}}: mention of inefficiency)
Line 70: Line 70:


=={{header|Perl 6}}==
=={{header|Perl 6}}==

Here is quite a naive algorithm, probably <math>O(n^2)</math>.

<lang Perl 6>multi suffix-tree(Str $str) { suffix-tree map &flip, [\~] $str.flip.comb }
<lang Perl 6>multi suffix-tree(Str $str) { suffix-tree map &flip, [\~] $str.flip.comb }
multi suffix-tree(@a) {
multi suffix-tree(@a) {