Develop a string matching algorithm to find a pattern P of length m from a text T of length n (n > m), with the following logic and write pseudocode. What is the complexity class of your algorithm? align the pattern against the first m characters of the text and start matching the corresponding pairs of characters from right to left (from the last element in the pattern and the corresponding element in the text). until either all the m pairs of the characters match (then the algorithm can stop) or a mismatching pair is encountered. In the mismatch case, shift the pattern one position to the right and resume the character comparisons, starting again with the last character of the pattern and its counterpart in the text. If a match occurs, then return the starting index in the text from where it matches with the pattern. If there is no match, then return -1. The algorithms starting sentences are as follows: ALGORITHM StringMatch (T [0..n − 1], P[0..m − 1]) //Implements string matching //Input: An array T [0..n − 1] of n characters representing a text and // an array P[0..m − 1] of m characters representing a pattern //Output: The index of the first character in the text that starts a matching substring or −1 if the search is unsuccessful

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Develop a string matching algorithm to find a pattern P of length m from a text T of length n (n > m), with the following logic and write pseudocode. What is the complexity class of your algorithm?

align the pattern against the first m characters of the text and
start matching the corresponding pairs of characters from right to left (from the last element in the pattern and the corresponding element in the text).
until either all the m pairs of the characters match (then the algorithm can stop)
or a mismatching pair is encountered.
In the mismatch case, shift the pattern one position to the right and
resume the character comparisons, starting again with the last character of the pattern and its counterpart in the text.
If a match occurs, then return the starting index in the text from where it matches with the pattern.
If there is no match, then return -1.

The algorithms starting sentences are as follows:

ALGORITHM StringMatch (T [0..n − 1], P[0..m − 1])
//Implements string matching
//Input: An array T [0..n − 1] of n characters representing a text and
// an array P[0..m − 1] of m characters representing a pattern
//Output: The index of the first character in the text that starts a matching substring or −1 if the search is unsuccessful

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions