Application: -

Choose a problem youd like to investigate e.g. maze solver, NPC navigation on a map, packets path on a network, searching in a large directory, etc.

- YOUR CODE MUST BE IN C++ ONLY! - Decide on two standard algorithms that you think fit as solutions to this problem. - Example: String searching algorithms e.g. Boyer-Moore, Aho-Corasick to find the occurrences of a particular string within a large body of text. You can use the text-searching lab exercise as a starting point for this. - Implement them both and measure and compare their performance with varying input sizes. Make sure you have a good range of data input sizes and compare both algorithms with all input size options. - Record the performance and consider how to present the results. - Follow good programming practices throughout. Acknowledge and reference any external resources used in your code.

Thank You Very Much Expert; Can you also specify and you must, The problem you are solving, Which two algorithms that you did, Example: I compared Algorithm1 and Algorithm2 to solve a maze. Or I compared Algorithm1 and Algorithm2 to search for keywords in a webserver log file etc. Hypothesise their complexity - Example: Based on the this and that,Algorithm1 has O(XYZ) while Algorithm2 is O(ABC), making it faster/slower etc. What data structures you used to implement them, Experiment procedure - Explain experiment setting and how you measured the actual performance & Performance evaluation Bullet points, Expert you must answer these questions in order to complete the programming code requirements.