The instructions and starting templates for the assignment are attached to this module.  Please download them and follow the instructions.  You should submit your completed .cpp source files to this MyLeoOnline folder by the due date once you are done with the assignment. There are actually 3 source files/starting templates for this assignment: assg-05.cpp, QuickSort.hpp and QuickSort.cpp.  You need to download and use all 3.  assg-05.cpp contains the main function and has tests of your code.  You should not need to add anything to this file, simply uncomment the tests as you are working on your assignment.  You should add your name and information to the file header at the top of all 3 files.  The files QuickSort.hpp and QuickSort.cpp are the header file and implementation file respectively.  You will need to add the function prototypes to the .hpp header file class definitions for the  functions you are to write for this assignment.  And likewise, you will need to write and  implement your functions for this assignment in the .cpp file.

This assignment involves working with three source files: assg-05.cpp, QuickSort.hpp, and QuickSort.cpp. The main function is contained in the assg-05.cpp file and it includes tests for the code. It is important to note that you should not add anything to this file, but rather uncomment the tests as you work through the assignment.

In order to complete this assignment, you will need to download all three source files and add your name and relevant information to the file header at the top of each file. The file QuickSort.hpp is the header file, while QuickSort.cpp is the implementation file. You will need to add function prototypes to the .hpp file for the functions you are required to write for this assignment. The actual implementation of these functions should be written in the .cpp file.

The assignment focuses on the implementation of the QuickSort algorithm, which is a popular sorting algorithm in computer science. The goal of QuickSort is to efficiently sort a given list of elements. The algorithm works by partitioning the list into two sub-arrays based on a chosen pivot element and recursively sorting each sub-array.

To complete this assignment, you will need to understand the QuickSort algorithm and its implementation. The provided templates already include the necessary code structure and function definitions, so your task is to fill in the missing parts.

In the QuickSort.hpp file, you will find the class definition for the QuickSort class. This is where you should add the function prototypes for the functions you will implement in the QuickSort.cpp file. Make sure to match the function signatures provided in the assignment instructions.

In the QuickSort.cpp file, you will find the implementation of the QuickSort class functions. Your task is to write the actual code for these functions based on the algorithmic requirements specified in the assignment. Be sure to follow best practices and use appropriate variable names, comments, and coding style conventions.

Once you have completed the assignment, you should submit the .cpp source files to the designated MyLeoOnline folder by the specified due date. Ensure that your code compiles and runs correctly by testing it with the provided tests in the assg-05.cpp file.

Need your ASSIGNMENT done? Use our paper writing service to score better and meet your deadline.


Click Here to Make an Order Click Here to Hire a Writer