top | item 38060808

(no title)

ultrablack | 2 years ago

Agree completely. I didn't read the entire article, but suffix trees are not hard to build in near linear time. I'm sure I was taught this in basic algorithms in 1993.

discuss

order

No comments yet.