1 / 6

brute force string matching algorithm

By Chirayu and Dalton. brute force string matching algorithm. What is it?. it’s a program in which a case sensitive text is searched for in a large body of text The program goes through the text and tells you if what you are searching exists in the larger body. How does it work?.

sarah-todd
Download Presentation

brute force string matching algorithm

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. By Chirayu and Dalton brute force string matching algorithm

  2. What is it? • it’s a program in which a case sensitive text is searched for in a large body of text • The program goes through the text and tells you if what you are searching exists in the larger body.

  3. How does it work? • The program searches each character individually to check for a match. • If there is a match then the program will check the next character in the sequence. • The program will continue to check until there are all matches or until it reaches the end of the larger body of text.

  4. output • If the selected text exists in the larger document then the program confirms and notifies the user about it. • If the selected text doesn’t exist in the larger body then the user is notified that their search query doesn’t exist in the program.

  5. Examples • A similar program to this one is the “ctrl f” command. • When you access it asks for a text to search for. Once you input your search query it checks the document for those exat characters.

  6. Work cited • Boyer-Moore Algorithm. Digital image. N.p., n.d. Web. <http://polynomialtimes.com/algorithms/space-and-time-trade-offs/boyer-moore-algorithm/>. • "Brute Force Sorting and String Matching." Brute Force Sorting and String Matching. N.p., n.d. Web. 10 May 2013. <http://www.csl.mtu.edu/cs4321/www/Lectures/Lecture 5 - Brute Force Sorting and String Matching.htm>. • "Computer Algorithms: Brute Force String Matching." Stoimens Web Log. N.p., n.d. Web. 10 May 2013. <http://www.stoimen.com/blog/2012/03/27/computer-algorithms-brute-force-string-matching/>. • Ctrl-F Functionality in Firefox. Digital image. N.p., n.d. Web. <http://blog.fpinfomart.ca/2011/10/19/shortcut-shocker-90-percent-of-people-dont-know-how-to-use-ctrlf/>.

More Related