Ternary Heap Sort

Ternary Heap Sort is a variation of Heap Sort where each parent node has three children instead of two. It maintains a ternary max-heap and repeatedly extracts the maximum element.