Optimal algorithms for inserting a random element into a random heap

Two algorithms for inserting a random element into a random heap are shown to be optimal (in the sense that they use the least number of comparisons on the average among all comparison-based algorithms) for different values of n under a uniform model.