From 946c5029530e5323340120cc197f8fd74a44f47b Mon Sep 17 00:00:00 2001 From: Avinash Kumar Date: Mon, 31 Oct 2022 18:14:58 +0530 Subject: [PATCH] Heap_Sort code added --- Heap Sort/Heap_Sort.cpp | 76 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 76 insertions(+) create mode 100644 Heap Sort/Heap_Sort.cpp diff --git a/Heap Sort/Heap_Sort.cpp b/Heap Sort/Heap_Sort.cpp new file mode 100644 index 00000000..21b8bcf4 --- /dev/null +++ b/Heap Sort/Heap_Sort.cpp @@ -0,0 +1,76 @@ +#include +using namespace std; + +// To heapify a subtree rooted with node i +// which is an index in arr[]. +// n is size of heap +void heapify(int arr[], int N, int i) +{ + + // Initialize largest as root + int largest = i; + + // left = 2*i + 1 + int l = 2 * i + 1; + + // right = 2*i + 2 + int r = 2 * i + 2; + + // If left child is larger than root + if (l < N && arr[l] > arr[largest]) + largest = l; + + // If right child is larger than largest + // so far + if (r < N && arr[r] > arr[largest]) + largest = r; + + // If largest is not root + if (largest != i) { + swap(arr[i], arr[largest]); + + // Recursively heapify the affected + // sub-tree + heapify(arr, N, largest); + } +} + +// Main function to do heap sort +void heapSort(int arr[], int N) +{ + + // Build heap (rearrange array) + for (int i = N / 2 - 1; i >= 0; i--) + heapify(arr, N, i); + + // One by one extract an element + // from heap + for (int i = N - 1; i > 0; i--) { + + // Move current root to end + swap(arr[0], arr[i]); + + heapify(arr, i, 0); + } +} + + +void printArray(int arr[], int N) +{ + for (int i = 0; i < N; ++i) + cout << arr[i] << " "; + cout << "\n"; +} + + +int main() +{ + int arr[] = { 12, 11, 13, 5, 6, 7 }; + int N = sizeof(arr) / sizeof(arr[0]); + + // Function call + heapSort(arr, N); + + cout << "Sorted array is \n"; + printArray(arr, N); +} \ No newline at end of file