From a6289175d13d80dbb0c2be8830ca1bc218d7b888 Mon Sep 17 00:00:00 2001 From: chintansood Date: Sat, 18 Oct 2025 19:56:24 +0530 Subject: [PATCH 1/2] Added Heap Sort algorithm in Python for Hacktoberfest 2025 --- sorts/heap_sorting.py | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 sorts/heap_sorting.py diff --git a/sorts/heap_sorting.py b/sorts/heap_sorting.py new file mode 100644 index 000000000000..8c68c2538933 --- /dev/null +++ b/sorts/heap_sorting.py @@ -0,0 +1,26 @@ +def heapify(arr, n, i): + largest = i + l = 2 * i + 1 + r = 2 * i + 2 + + if l < n and arr[l] > arr[largest]: + largest = l + if r < n and arr[r] > arr[largest]: + largest = r + if largest != i: + arr[i], arr[largest] = arr[largest], arr[i] + heapify(arr, n, largest) + +def heap_sort(arr): + n = len(arr) + for i in range(n // 2 - 1, -1, -1): + heapify(arr, n, i) + for i in range(n - 1, 0, -1): + arr[i], arr[0] = arr[0], arr[i] + heapify(arr, i, 0) + +if __name__ == "__main__": + arr = [12, 11, 13, 5, 6, 7] + print("Original array:", arr) + heap_sort(arr) + print("Sorted array:", arr) From 5a09f4c45910a59d4ce6bf4b7ad1c7ea61e89bc6 Mon Sep 17 00:00:00 2001 From: "pre-commit-ci[bot]" <66853113+pre-commit-ci[bot]@users.noreply.github.com> Date: Sun, 19 Oct 2025 07:06:16 +0000 Subject: [PATCH 2/2] [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --- sorts/heap_sorting.py | 2 ++ 1 file changed, 2 insertions(+) diff --git a/sorts/heap_sorting.py b/sorts/heap_sorting.py index 8c68c2538933..98f69e9bb67b 100644 --- a/sorts/heap_sorting.py +++ b/sorts/heap_sorting.py @@ -11,6 +11,7 @@ def heapify(arr, n, i): arr[i], arr[largest] = arr[largest], arr[i] heapify(arr, n, largest) + def heap_sort(arr): n = len(arr) for i in range(n // 2 - 1, -1, -1): @@ -19,6 +20,7 @@ def heap_sort(arr): arr[i], arr[0] = arr[0], arr[i] heapify(arr, i, 0) + if __name__ == "__main__": arr = [12, 11, 13, 5, 6, 7] print("Original array:", arr)