I think for insertion, once you find the heap the new element should be inserted into, you would remove the max element from the heap, and re-heapify that subarray with the new element. Then you would insert the max you just removed into the next heap in the same way, and so on. That sounds like it could be less expensive than shifting the whole array, but I haven&#x27;t done the math (and it seems that Alexandrescu hasn&#x27;t either, yet).<p>Note that I&#x27;m making a couple assumptions about the data structure that were left unstated in the original post:<p>* Each element of each heap is less than every element of every subsequent heap.<p>* &quot;When the max value in a heap is less than the searched element&quot; was a typo and &quot;When the max value in a heap is <i>greater than</i> the searched element&quot; was intended.<p>Maybe I just totally misunderstand this data structure though :-( It&#x27;s still morning for me.