Question: corman chapter 61 an array sorted in ascending order is...
Corman. Chapter 6.1. An array sorted in ascending order is already a min-heap.
Assuming a min heap is already a sorted array, is there an algorithm to insert a new item into the heap, maintaining the sorted order? what is the O(t)?