BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

Computer Science

809Review: Standard Binary Search
810Lower Bound Search
811Upper Bound Search
812Finding First Occurrence
813Finding Last Occurrence
814Counting Occurrences with Binary Search
815Binary Search on Answer Space
816Binary Search on Rotated Sorted Arrays
817Finding Rotation Point
818Binary Search on Infinite Arrays
819Binary Search in 2D Matrices
820Ternary Search for Unimodal Functions
821The Selection Problem Definition
822Naive Selection via Sorting
823Randomized QuickSelect Algorithm
824QuickSelect Analysis and Performance
825Median of Medians: Deterministic Selection
826Median of Medians: Partitioning Strategy
827Median of Medians: Complexity Proof
828Finding Minimum and Maximum Efficiently
829Simultaneous Min and Max
830Selection in Specialized Contexts
831String Search Problem and Naive Approach
832Rabin-Karp Algorithm: Rolling Hash
833Rabin-Karp: Collision Handling
834Knuth-Morris-Pratt: Prefix Function
835KMP: Pattern Matching Algorithm
836Boyer-Moore: Bad Character Rule
837Boyer-Moore: Good Suffix Rule
838Boyer-Moore: Combined Algorithm
839Multiple Pattern Matching: Aho-Corasick
840String Searching Applications and Tradeoffs

Computer Science

809Review: Standard Binary Search
810Lower Bound Search
811Upper Bound Search
812Finding First Occurrence
813Finding Last Occurrence
814Counting Occurrences with Binary Search
815Binary Search on Answer Space
816Binary Search on Rotated Sorted Arrays
817Finding Rotation Point
818Binary Search on Infinite Arrays
819Binary Search in 2D Matrices
820Ternary Search for Unimodal Functions
821The Selection Problem Definition
822Naive Selection via Sorting
823Randomized QuickSelect Algorithm
824QuickSelect Analysis and Performance
825Median of Medians: Deterministic Selection
826Median of Medians: Partitioning Strategy
827Median of Medians: Complexity Proof
828Finding Minimum and Maximum Efficiently
829Simultaneous Min and Max
830Selection in Specialized Contexts
831String Search Problem and Naive Approach
832Rabin-Karp Algorithm: Rolling Hash
833Rabin-Karp: Collision Handling
834Knuth-Morris-Pratt: Prefix Function
835KMP: Pattern Matching Algorithm
836Boyer-Moore: Bad Character Rule
837Boyer-Moore: Good Suffix Rule
838Boyer-Moore: Combined Algorithm
839Multiple Pattern Matching: Aho-Corasick
840String Searching Applications and Tradeoffs

← Computer Science

Lesson 834 of 2,872·19. Searching and SelectionPro lesson

Knuth-Morris-Pratt: Prefix Function

Introduce the KMP algorithm's prefix function (failure function) that enables skipping characters during mismatch.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.

See pricing Back to course