This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: When you run Boyer-Moore algorithm, you have to decide the input string and the reference string, like the example above. (d) For Kruskal’s algorithm, you just have to print out the final MST and the cost. For Boyer-Moore algorithm, you have to print out each step of the algorithm. Any format is OK if TA can understand your results. Explain your format in your documentation file. (e) You MUST use the O(n G(n)) Union-find algorithm so as to not make cycles in Kruskal’s algorithm. (f) You MUST write a short report on algorithm of Union-find. Due date December 10th. 23:59 p.m. (Wednesday) Send to [email protected] your source code, executable file, documentation. E-Mail title format: [CS300 PA03 by 20040001] Explanation of your code and method of compilation have to be contained in your documentation file. No delay is allowed...
View Full Document
- Spring '08
- TA, Filename extension, Computer program, String searching algorithm