 The algorithm requires O(log "n" * log "n") comparisons.The view also presents a new and conceptually simple algorithm for merging heaps.When merging is a common task, a different heap implementation is recommended, such as binomial heaps, which can be merged in O(log "n").