Recommendation

Has Potential

Link

http://www.eecs.wsu.edu/~holder/courses/cse2320/lectures/applets/string/test.html

Delivery Method

Java Applet

License

Language

English

Author

Lawrence Holder

Institution

University of Texas, Arlington

Project

StandAlone

RelationshipToProject

StandAlone

Works

Yes

Description

This tool compares the performance of brute force, Knuth-Morris-Pratt and Boyer-Moore string matching algorithms.

Evaluation

This visualization tool has very minimal information and is not very good example of string matching visualization tools out there on the web. The tool compares brute force, Knuth-Morris-Pratt and Boyer-Moore algorithms on the basis of time they take for any given set of data. However in this case given set of data is fixed (one set of predefined string of numbers and a pattern string). You can start animation by clicking the pattern string which then stops at the finish. It does not highlight matched pattern or any other points of interests. Also there is no explanation about various algorithms. It is more like a black box which in the end tells you how finished first. I would say it is practically unusable until or unless you use it for performance comparison purpose only.

ActivityLevel

GoodFor

Comparison

Screenshots

Videos

References

HowToUse

First Visited

2007

Last Visited

Last Updated

Topic

StringMatching

Community

Edit

You may edit this entry if you have an account.