C++ Tutorial Index

C++ Tutorial C++ History C++ Installation C++ First Program C++ cin and cout C++ Data type C++ Variable C++ operator C++ Keywords

C++ Control Statements

C++ If C++ Nested if C++ If-else C++ If-else-if C++ Switch C++ Break C++ Continue C++ Goto C++ For loop C++ While loop C++ Do while loop

C++ Functions

C++ Call by Value C++ Call by Reference C++ Recursion Function C++ Inline function C++ Friend function

C++ Arrays

Single dimension array Two dimension array

C++ Strings

C++ Strings

C++ Inheritance

C++ Inheritance Single level Inheritance Multilevel Inheritance Multiple Inheritance Hierarchical Inheritance Hybrid Inheritance

C++ Polymorphism

C++ Polymorphism C++ Overloading C++ Overriding C++ Virtual Function

C++ Pointers

C++ Pointers C++ this pointer

C++ Exception Handling

C++ Exception Handling

C++ Constructors

C++ Constructors Default Constructor Parameterize Constructor Copy constructor Constructor Overloading Destructor

C++ File Handling

C++ File Handling C++ Writing to file C++ Reading file C++ Close file

Miscellaneous

C Vs C++ C++ Comments C++ Data Abstraction C++ Identifier C++ Memory Management C++ Storage Classes C++ Void Pointer C++ Array To Function C++ Expressions C++ Features C++ Interfaces C++ Encapsulation std::min in C++ External merge sort in C++ Remove duplicates from sorted array in C++ Precision of floating point numbers Using these functions floor(), ceil(), trunc(), round() and setprecision() in C++ C++ References C++ Friend Functions C++ Mutable keyword Unary Operators in C++ Initialize Array of objects with parameterized constructors in C++ Differences between #define & const in C/C++ C++ Program to Implement Shell Sort C++ Program to Implement Merge Sort Storage Classes in C Vector resize() in C++ Passing by Reference Vs. Passing by the pointer in C++ Free vs delete() in C++ goto statement in C and C++ C++ program to read string using cin.getline() C++ String Concatenation Heap Sort in C++ Swap numbers in C++ Input Iterators in C++ Fibonacci Series in C++ C ++ Program: Alphabet Triangle and Number Triangle C++ Program: Matrix Multiplication C++ Program to Print Fibonacci Triangle Stack in C++ Maps in C++ Queue in C++ C++ Bitset C++ Algorithms Priority Queue in C++ C++ Multimap C++ Deque Function Pointer in C++ Sizeof() Operators in C++ C++ array of Pointers free() Vs delete in C Timsort Implementation Using C++ CPP Templates C++ Aggregation C++ Enumeration C++ Math Functions C++ Object Class C++ Queue Initialize Vector in C++ Vector in C++ C++ STL Components Function overloading in C++ C++ Maximum Index Problem C++ find missing in the second array C++ Program to find the product array puzzle C++ Program To Find Largest Subarray With 0 Sum C++ Program To Move All Zeros To The End Of The Array C++ Program to find the element that occurs once C++ Program to find the largest number formed from an array Constructor Vs Destructor C++ Namespaces C++ OOPs Concept C++ Static C++ Structs C++ Try-Catch C++ User Defined Exceptions C++ Virtual Destructor C++ vs C# Malloc() and new in C++ Palindrome Number Program in C++ Snake Code in C++ Splitting a string in C++ Structure Vs Class in C++ Virtual Function Vs Pure Virtual Function C++ Bidirectional Iterators C++ Forward Iterators C++ Iterators C++ Output Iterators C++ Range-based For Loop Converting string into integer in C++ LCM Program in C++ Type conversion in C++ Add two numbers using the function in C++ Advantage and disadvantage friend function C++ Armstrong Number Program in C++ ATM machine program in C++ using functions Binary to Decimal in C++ Bit Manipulation in C++ C++ Constructor C++ Dijkstra Algorithm Using the Priority Queue C++ int into String C++ Signal Handling Decimal to Binary in C++ Decimal to Hexadecimal in C++ Decimal to Octal in C++ Factorial Program in C++ Function in C++ Hexadecimal to Decimal in C++ Octal to Decimal in C++ Reverse a Number in C++ Structure Vs Class in C++ C++ Forward Iterators C++ Output Iterators C++ Prime number program Constructor Overloading in C++ Different Ways to Compare Strings in C++ Program to convert infix to postfix expression in C++ SET Data Structure in C++ Upcasting and Downcasting in C++ Reverse an Array in C++ Fast Input and Output in C++ Delete Operator in C++ Copy elision in C++ C++ Date and Time C++ Bitwise XOR Operator Array of sets in C++ Binary Operator Overloading in C++ Binary Search in C++ Implementing the sets without C++ STL containers Scope Resolution Operator in C++ Smart pointers in C++ Types of polymorphism in C++

Heap Sort in C++

Heapsort is executed on the structure of the heap data. We know heap is a complete tree in binary form. The heap tree can be of two different types: Min-heap, or heap max. The root element is minimal for min-heap, and maximum for a max heap. Upon forming a heap, we can remove an object from the root and transfer the last element to the root. After this procedure of swapping, we have to heap the whole array again. We can filter the entire array by removing elements from the root.

The complexity of Heap Sort Technique

  • Time Complexity: O(n log n)
  • Space Complexity: O(1)

Input and Output

Input:

A list of unsorted data: 50 4 11 40 32 81 70

Output:

Array before Sorting: 50 4 11 40 32 81 70

Array after Sorting: 4 11 32 40 50 70 81

Algorithm

Input: A data array, and the total number in the array

Output: Max heap using an element in an array

Begin
for k := 1 to size do
node := k
par := floor (node / 2)
while par >= 1 do
if array[par] < array[node] then
swap array[par] with array[node]
node := par
par := floor (node / 2)
done
done
End

What is a Binary Heap?

This Binary Heap is a complete binary tree in which entities are placed in a special order, such that a parental node’s value is greater than its two nodes’ values. The former is called a heap max, while the latter a heap min. The heap can be described through an array or binary tree.

Algorithm for sorting in increasing order:-

  1. Create a maximum heap of the data input.
  2. The greatest element is placed at the root of the heap at this stage. Replace it with the last heap component, then increase the heap size by 1.
  3. Repeat steps above whilst heap size is greater than 1.

How to create a heap?

The heapify procedure can only be implemented to a node if it heaps its children’s nodes. Thus heapification must be carried out in the order from the bottom up.

Using an example let’s understand:

Input data: 6, 20, 2, 7, 1
         6(0)
        /   \
     20(1)   2(2)
    /   \
 7(3)    1(4)

The numbers in bracket represent the indices in the array representation of data.

Applying the heapify procedure to index 1:
         6(0)
        /   \
    20(1)    2(2)
    /   \
7(3)    1(4)
Applying the heapify procedure to index 0:
        20(0)
        /  \
     7(1)  2(2)
    /   \
 6(3)    1(4)
The heapify procedure calls itself recursively to build the heap
 in the top down manner.

Example of heap sort implementation:

// C++ program for implementation of Heap Sort
include
using namespace std;
void heapify(int arr[], int s, int k)
{
    int largest = k; // Initialize largest as root
    int P = 2k + 1; // left = 2k + 1
    int v= 2k + 2; // right = 2k + 2
    if (P < s && arr[P] > arr[largest]) largest = P; // If right child is larger than largest so far
    if (v < s && arr[v] > arr[largest]) largest = v; // If largest is not root
    if (largest != k)
    {
    swap(arr[k], arr[largest]);  // Recursively heapify the affected sub-tree
        heapify(arr, s, largest);
    }
}  // main function to do heap sort
void heapSort(int arr[], int s)
{
    // Build heap (rearrange array)
    for (int k = s / 2 - 1; k >= 0; k--)
    heapify(arr, s, k);  // One by one extract an element from heap
    for (int k=s-1; k>0; k--)
    {
        // Move current root to end
        swap(arr[0], arr[k]);
        // call max heapify on the reduced heap
        heapify(arr, k, 0);
    }
}
/* A utility function to print array of size s */
void printArray(int arr[], int s)
{
    for (int k=0; k<s; ++k)
        cout << arr[k] << " ";
    cout << "\n";
}
// Driver program
int main()
{
    int arr[] = {20, 10, 16, 4, 8, 6, 2, 44};
    int s = sizeof(arr)/sizeof(arr[0]);
    heapSort(arr, s);
    cout << "Sorted array is \n";
    printArray(arr, s);
}
Heap Sort in C++



ADVERTISEMENT
ADVERTISEMENT