Y
Hacker News
new
|
ask
|
show
|
jobs
by
ultrablack
970 days 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.