Over 100 Sorting Algorithms in Under 90 Minutes - Ternary Heapified Inputs

This is a heap with three children per node. Thanks to _fluffyy for making the Base N Max Heap Sort used to heapify the array. 0:00 - Exchange Sorts 10:16 - Selection Sorts 15:54 - Insertion Sorts 23:49 - Merge Sorts 32:17 - Distribution Sorts 39:18 - Concurrent Sorts 50:31 - Hybrid Sorts 1:12:26 - Miscellaneous Sorts 1:13:35 - Impractical Sorts Check out the program here: Visit The Studio here: