[fpc-pascal] Suffix Trie implementation, please review

leledumbo leledumbo_cool at yahoo.co.id
Tue May 24 18:48:10 CEST 2011

I've written a unit containing suffix trie implementation. It could be used
for: fast string existence search (could be extended with other information
if required), though takes quite a lot of spaces (O(n^2) for a string where
n is the string length, but grow slower as more strings get added), the
existence search have O(m) complexity where m is the string to search for.
This string to search for could be exact or a substring of previously added

Please have a look and try it (a test program is included), open for
suggestions or whatever you want to say.

View this message in context: http://free-pascal-general.1045716.n5.nabble.com/Suffix-Trie-implementation-please-review-tp4422708p4422708.html
Sent from the Free Pascal - General mailing list archive at Nabble.com.

More information about the fpc-pascal mailing list