21 search results - page 5 / 5 » On-Line Linear-Time Construction of Word Suffix Trees |
SIAMCOMP
2002
13 years 5 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...