← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

32 第32章 字符串匹配

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.767Z

ut to O(n 1g2 n). A simple observation allows us to reduce the running time to Θ(n 1g n).

The values of left-rank and right-rank being sorted in line 18 are always integers in the range 0 to n. Therefore, radix sort can sort the substr-rank array in Θ(n) time by first running counting sort (see Chapter 8) based on right-rank and then running counting sort based on left-rank. Now each iteration of the while loop of lines 10–19 takes only Θ(n) time, giving a total time of Θ(n 1g n). Exercise 32.5-2 asks you to make a simple modification to COMPUTE-SUFFIX-ARRAY that allows the while loop of lines 10–19 to iterate fewer than ⌈1g n⌉ – 1 times for certain inputs. Computing the LCP array Recall that LCP[i] is defined as the length of the longest common

prefix of the (i – 1)st and ith lexicographically smallest suffixes T[SA[i – 1]:] and T[S

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea