C++ mini project -- 3

Introduction This project will provide hands on experience implementing and analyzing fundamental sorting algorithms, and applying commonly used data structures. You will also practice how to write good technical reports. This is an individual project. All software and the report must be written individually, and be your own work. Your programming must be of high quality with good variable names, function names, and comments. It should look artistic, and be easy for technically competent readers to understand. The focus here is different sorting algorithms and data structures. Don't over-engineer your program with things like user input from the console! You may recompile your code with different hard-coded parameters to test different conditions. Software Development Write C++ functions to implement the following sort algorithms: Bubble sort Insertion sort Merge sort Quicksort For each algorithm, write three (3) function overloads in order to supports the following STL containers: std::vector<unsigned> std::list<unsigned> std::set<unsigned> Develop standardized tests for your sort functions: Use a method such as a shuffle algorithm to create vectors, lists, and sets containing a configurable number n of random values. Output relevant parameters and results to the console. Design Details Incorporate [login to view URL] the document into your source code. This header provides declarations for the required sort functions and supporting SortMetrics structure. You must use these declarations and write implementation code accordingly. Implement each function as declared in the header. Write test code in main.cpp. You may write supporting functions in [login to view URL] or add other source files as appropriate for specific functions, test procedures, etc. Structure your source code as follows: src\ [login to view URL] ... bubble_sort functions [login to view URL] ... insertion_sort functions [login to view URL] ... main function and any supporting test functions [login to view URL] ... merge_sort functions [login to view URL] ... quicksort functions [login to view URL] ... all sort-related declarations [login to view URL] ... non-member SortMetrics function [other source files as appropriate to support testing] Test and Evaluation Verify your sorting functions work as expected. Determine at least three (3) appropriate n values for testing. These should be orders of magnitude different in order to evaluate how the algorithms perform as the problem size scales up. For example: 100; 1,000; and 10,000 elements. Capture test results for each algorithm, STL container, and problem size (n). For each algorithm, test with random unsorted data, and within the same execution re-test using the sorted data. Document your results in the report. Tip: You can pipe output from your program to a file from a command prompt: my_program >[login to view URL]