Programming Assignment: Search and Sort Algorithms with C$++20$ and STL

Objective: The objective of this programming assignment is to implement various search algorithms $($divide and conquer, greedy, Las Vegas$)$ and sorting algorithms $($merge sort, heap sort, quick sort$)$ within the context of an abstract base class in C$++20$ using the Standard Template Library $($STL$).$ This assignment aims to enhance your understanding of algorithmic strategies and their application in real$-$world problem$-$solving scenarios.

Figure $1$: The Abstract Problem Class

Assignment Tasks:

Implement the required abstract methods required by the solve$\_$divide$\_$and$\_$conquer$(),$ solve$\_$greedy$(),$ and solve$\_$las$\_$vegas$()$ methods in the Problem class. Choose appropriate algorithms for each.

Implement the merge$\_$sort$(),$ heap$\_$sort$(),$ and quick$\_$sort$()$ methods in the derived SearchAndSortProblem class using C$++20$ and STL$.$

Test the implemented algorithms by creating an instance of the SearchAndSortProblem class with randomly generated data.

Assessment Criteria:

Your assignment will be assessed based on the following criteria:

Algorithmic Correctness: Ensure that your implementations of search and sort algorithms are correct and produce the expected results.

Code Readability: Write clear, well$-$documented, and organized code. Use meaningful variable and function names.

STL Usage: Demonstrate effective use of C$++20$ features and STL algorithms for sorting and other operations.

Abstraction: Utilize the abstract base class appropriately, providing concrete implementations for the specified methods.

Testing: Conduct thorough testing of the implemented algorithms to validate their correctness and efficiency.Properties $/$ Methods $-$ Class Diagram