#heapsort #iot #C #esp32 #sorts #bigo #shots Heap sort, example: in C plus plus. Heap sort is a comparison-based sorting algorithm that first converts the input array into a special kind of binary tree called a heap, and then sorts the elements of the array by repeatedly removing the maximum element from the heap and placing it at the end of the sorted output. More information in the full video on the channel. 🤍youtu.be/cZaqBniyMdw