IgSaf issues

Repositories
Issues
Comments

Results 1 issues of


                                            IgSaf

O(n^2) time complexity due to list copy

There is a copy of list in [unfold function](https://github.com/mutux/Ukkonen-s-Suffix-Tree-Algorithm/blob/e4578e4be99443a0c3c33d308fc53ef894e76c7d/suffixtree.py#L158). It leads to `O(len(remains))` time complexity for this operation. And due to being inside `while remainder > 0` this gains O(n^2)...