原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
ositions, set ri = ☐. Figure 32.16 shows the ranks for T = bippityboppityboo with n = 17.
H. Sort the nonsample suffixes by comparing tuples (T[i], ri+1). In our example, we get T[15:] < T[12:] < T[9:] < T[3:] < T[6:] because (b, 6) < (i, 10) < (o, 9) < (p, 8) < (t, 12). 3. Merge the sorted sets of suffixes. From the sorted set of suffixes, determine the suffix array of T. This completes the description of a linear-time algorithm for computing suffix arrays. The following parts of this problem ask you to show that certain steps of this algorithm are correct and to
analyze the algorithm’s running time. a. Define a nonempty suffix at position i of the te
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea