heap sort

new file:   trees/heap/heapAlgorithms.go

README.md

@@ -25,6 +25,7 @@
 - [x] Kadane's Algorithm
 - [x] Euclidean gcd
 - [x] Fibonacci
+- [x] Heap Sort
 - [ ] Modular Arithmetic
 - [ ] Sieve of Eratosthenes
 - [x] BFS Breadth-First Search

trees/heap/heapAlgorithms.go

@@ -0,0 +1,30 @@
+package heap
+
+import (
+	"cmp"
+)
+
+// HeapSrort() -> takes in an array and returns it sorted. O(n log n)
+func HeapSrort[T cmp.Ordered](arg []T) []T {
+	if len(arg) <= 0 {
+		return nil
+	}
+
+	heap := NewMinHeap[T]()
+	heap.Heapify(arg)
+
+	sorted := make([]T, 0, len(arg))
+
+	for range heap.Array {
+
+		val, ok := heap.PopMin()
+
+		if !ok {
+			break
+		}
+
+		sorted = append(sorted, val)
+	}
+
+	return sorted
+}