SE701:Redundant detector

From Marks Wiki

Revision as of 20:20, 15 February 2008 by Mark (talk | contribs) (New page: * Description: implement a redundancy detector. Design and implement an algorithm for finding the longest repeated sequence in a long string of characters. For example, abra is the longest...)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Description: implement a redundancy detector. Design and implement an algorithm for finding the longest repeated sequence in a long string of characters. For example, abra is the longest repeated sequence in the string abracadabra.

Another algorithm related topic.

More info: http://www.cs.princeton.edu/courses/archive/spring03/cs226/assignments/redundant.html

Retrieved from "https://wiki.kram.nz/index.php?title=SE701:Redundant_detector&oldid=121"