原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
llowing page is to lexicographically sort substrings of the text with increasing lengths.
The procedure makes several passes over the text, with the substring length doubling each time. By the ⌈1g n⌉th pass, the procedure is sorting all the suffixes, thereby gaining the information needed to construct the suffix array. The key to attaining an O(n 1g n)-time algorithm will be to have each pass after the first sort in linear time, which will indeed be possible by using radix sort. Let’s start with a simple observation. Consider any two
strings, s1 and s2. Decompose s1 into and , so that s1 is concatenated with . Likewise, l
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea