Nave String Search algorithm, Rabin-Karp algorithm Knuth-Morris-Pratt algorithm, BoyerMoor algorithm Discrete Fourier Transform & Fast Fourier Transform
Question:
Naïve String Search algorithm, Rabin-Karp algorithm
Knuth-Morris-Pratt algorithm, Boyer–Moor algorithm
Discrete Fourier Transform & Fast Fourier Transform algorithms
Hamiltonian Cycle Problem & Traveling Salesman Problem in NP-Completeness
Find ONE example for each algorithm to clearly describe how do they works. Your explanation including:
a. Step by step on diagram/figure/graph.
b. Sample coding using any programming language (recommended to find the coding in programming language.
c. Compile, and run the code.
d. Screenshot the output screen and include it inside the document.
2. Differentiate the advantages and the drawback for both algorithms.
3. Applications of these algorithms in real-life.
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest