[Solved] CS240 Introduction to Computing III mp07 (Heap)

Objectives

▪ To implement a recursive version of quick sort using an array

▪ To time the algorithm

Project setup

Create the project mp07.<FirstLast>. Replace FirstLast with your name and do not include the <> brackets. For instance, mp07.SocratisTornaritis.

Add the provided files to your project:

main.cpp, heap.hpp, state.hpp, state.cpp

The folder mp07.Firstlast containing just the source file(s) and text file(s), is the one that you must zip and upload. Do not upload any IDE specific files.

Refer to the appropriate how to tutorial notes available on the course website, for instructions on how to create a project and manage its files.

Problem description:

Implement the heap by following the comments in the heap.hpp file and the algorithms found in the notes.

Program requirements:

(1) Implement the template Heap class in heap.hppUse the notes for the Heap implementation.

As you write your programs from here on out, documentation will be desirable and an essential part of your code. Add the following section to each of your programs to identify relevant information to anyone reading your code. The sample below is what I used for Main.java, so make the appropriate changes to reflect your current/accurate information. This is just a sample, so feel free to add to it if you want, but do not remove anything.

/* File: <filename>

• Name: <your name>
• Revised: <date authored>
• Course: CS240 Introduction to Computing III

*

• Desc: <program description>

*/