You are here

Fast String Searching

Author: 
Moore, J Strother
Issue Date: 
Monday, September 8, 2008
Description: 
This presentation talks about the need for string searching within large volumes of text. The Boyer-Moore fast string searching algorithm is demonstrated with extensive examples. A sample pseudocode implementation is provided and discussed.
Keywords: 
string searching, Boyer-Moore algorithm
Education Levels: 
Middle School
High School
Intended Audience: 
Educator
Type: 
Instructional Material : Lecture/Presentation
Publisher: 
U Texas-Austin
URL: 
http://www.cs.utexas.edu/~firstbytes/teachers/index.html
CSTA Classification: 

CT.L3B-01

Classify problems as tractable, intractable, or computationally unsolvable.

CT.L3B-04

Evaluate algorithms by their efficiency, correctness, and clarity.

CC.L3C-01d

Standard Data Structures (AP Comp Sci A Topic IV)

Download this resource: