Question

It is a bonus homework to implement either the AVL tree or the heap sort algorithm. You need to write your program in C++ following the object-oriented style, which means to have a header file to define a class, and to have an implementation C++ file to implement the class. You need to have a main.cpp file to test your implementation.

  

Can you explain how you got your answer also .... please and thank you very much.

Answer 1

/* Please read all the comments */

/* See the output */

// C++ program to simulate the Heap sort
#include <iostream>

using namespace std;

// Largest element is kept at root place in binary tree.
// Due to behavior of Complete Binary Tree, buildHeap() method can be done in array manner
// Assume Max element, parent data is at Index I
// Left child would be 2I + 1 && Right Child would be 2I + 2
// Array index is from 0
void buildHeap(int arr[], int totalElement, int i)
{
   int biggest = i; // Initialize biggest as root
   int leftChild = 2*i + 1;
   int rightChild = 2*i + 2;

   // check if left child is biggest than root
   if (leftChild < totalElement && arr[leftChild] > arr[biggest])
       biggest = leftChild;

   // If right child is larger than biggest
   if (rightChild < totalElement && arr[rightChild] > arr[biggest])
       biggest = rightChild;

   // If biggest is not root
   if (biggest != i)
   {
       swap(arr[i], arr[biggest]);

       // Recurse again buildHeap the for rest affected section
       buildHeap(arr, totalElement, biggest);
   }
}

// function to do heap sort
void heapSort(int arr[], int total)
{
   // start to Build heap
   for (int i = total / 2 - 1; i >= 0; i--)
       buildHeap(arr, total, i);

   // One by one get element from heap
   for (int i=total-1; i>=0; i--)
   {
       // Move current root element for the end position
       swap(arr[0], arr[i]);

       // Call buildHeap() with reduced heap
       buildHeap(arr, i, 0);
   }
}

// Function to show the array element
void showArray(int arr[], int n)
{
   for (int i=0; i<n; ++i)
       cout << arr[i] << " ";
   cout << "\n";
}

// Main Program
int main()
{
   int intArray[] = {12, 11, 13, 5, 6, 7};
   int n = sizeof(intArray)/sizeof(intArray[0]);
cout<< "Array Before sort "<<endl;
showArray(intArray,n);

cout<<" After HeapSort" ;
   heapSort(intArray, n);

   cout << "Sorted array is \n";
   showArray(intArray, n);
}

/* This is screen shot of output*/