Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
21 views2 pages

Heap Sort

The document contains C++ code that implements the heap sort algorithm. It includes functions for heapifying a subtree, performing heap sort, and printing the elements of an array. The main function demonstrates the sorting of an example array before and after applying the heap sort.

Uploaded by

61 C Hritick Sidana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
21 views2 pages

Heap Sort

The document contains C++ code that implements the heap sort algorithm. It includes functions for heapifying a subtree, performing heap sort, and printing the elements of an array. The main function demonstrates the sorting of an example array before and after applying the heap sort.

Uploaded by

61 C Hritick Sidana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

using namespace std;

// To heapify a subtree rooted with node i which


// is the index of arr[], and n is the size of the heap.
void heapify(int arr[], int n, int i) {
int largest = i;
int l = 2 * i + 1;
int r = 2 * i + 2;

// If the left child is larger than the root.


if (l < n && arr[l] > arr[largest])
largest = l;

// If the right child is larger.


if (r < n && arr[r] > arr[largest])
largest = r;

// If the root is not the largest.


if (largest != i) {
swap(arr[i], arr[largest]);

// Heapifying the sub-tree repeatedly.


heapify(arr, n, largest);
}
}
// Main function to do the heap sort.
void heapSort(int arr[], int n) {
// Build max-heap.
for (int i = n / 2 - 1; i >= 0; i--)
heapify(arr, n, i);

// Extracting element from the heap.


for (int i = n - 1; i >= 0; i--) {
// Moving the current root to the last element of the array.
swap(arr[0], arr[i]);

// Calling max heapify on the shrink heap.


heapify(arr, i, 0);
}
}

// Function to print elements of the array.


void Print(int arr[], int n) {
for (int i = 0; i < n; i++) {
cout << arr[i] << "\t";
}
cout << "\n";
}

int main() {

int arr[] = {2,1,12,14,8};


int n = sizeof(arr) / sizeof(arr[0]);
cout << "Before Sorting \n";
Print(arr, n);

heapSort(arr, n);

cout << "After Sorting the array looks like: \n";


Print(arr, n);
}

You might also like