I will need the Source Code For this, in C++ Coding Format Only.

Details Down below on what to do.

Your Source Code must be in C++ Only.

You will demonstrate, using a software project:

• Describe abstract and concrete requirements for data structures and algorithms.

• Describe a range of standard data structures and algorithms, in terms of both functionality and performance characteristics.

• By reasoning about behaviour and performance, be able to critically select appropriate data structures and algorithms for a given application within a software project.

  The application - Your application must:

• implement two different standard algorithms that solve the same real-world problem;

• make use of appropriate data structures for the application's needs;

• allow you to compare the performance of the two algorithms as you vary the size of the input data.

  Here are some suggestions:

• Shortest-path algorithms e.g. Lee, Dijkstra, A* applied on a 2D grid or an arbitrary graph. You can use the shortest-path lab exercise as a starting point for this. For example, you might implement pathfinding around a simulated world in a game, or selecting paths for packets being sent around a network.

• 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. For example, you might take a webserver log file and use an appropriate data structure to track how many times each page has been accessed.

• Tree searching and update algorithms e.g. for different types of binary trees. For example, you might build a tree representing a complex directory structure on disk, and use search algorithms to efficiently find files that have particular properties, or identify duplicate files.

  To meet the learning outcomes for the module, you need to demonstrate that you can implement reasonably complex algorithms by yourself. The following algorithms are not allowed because they're too simple to demonstrate this: brute-force string search, linear search, binary search, any sorting algorithm.

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. See assessment brief for other options that link directly to the taught materials (string searches, shortest path etc.). - Decide on two standard algorithms that you think fit as solutions to this problem. - 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.

Also Include:

• The Problem you are solving & Present the Problem
• Which Two Standard Algorithms you chose to solve this problem and compare one with another.
• Hypothesise their complexity for example: 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.
• Explain experiment settings and how you measured the actual performance.
• Present the performance with appropriate means.

You Must answer these questions in order to complete the Work, You can answer these questions regarding your code in a word document or in Notepad, whatever is accessible to you.