add : pull reaquest template

.gtihub/pull_request_template.md

@@ -0,0 +1,21 @@
+<!-- Thank you for sending a pull request :heart: -->
+
+## Current behavior
+
+<!-- Please describe the current behavior of the code before the changes in this pull request are applied. -->
+
+## Proposed changes
+
+<!-- Please describe the changes proposed in this pull request. -->
+<!-- If this pull request resolves an already recorded bug or a feature request, please add a link to that issue. -->
+
+## Checks
+
+<!--
+To help us review and merge this pull request quickly, please confirm the following
+by replacing the [ ] in front of each bullet point below with [x]
+-->
+
+- [ ] All commits in this Pull Request are [signed](https://docs.github.com/en/authentication/managing-commit-signature-verification/signing-commits) and Verified by Github.
+
+<!-- We're looking forward to merging your contribution!! -->

DSA/Arrays/Hipsort.js

@@ -0,0 +1,21 @@
+function heapSort(arr) {
+    // Build heap (rearrange array)
+    for (let i = Math.floor(arr.length / 2) - 1; i >= 0; i--)
+        heapify(arr, arr.length, i);
+
+    // One by one extract an element from heap
+    for (let i = arr.length - 1; i > 0; i--) {
+        // Move current root to end
+        let temp = arr[0];
+        arr[0] = arr[i];
+        arr[i] = temp;
+
+        // call max heapify on the reduced heap
+        heapify(arr, i, 0);
+    }
+    return arr;
+}
+
+Array = [12, 11, 13, 5, 6, 7];
+
+console.log(heapSort(Array));