Inserting a new element into a heap
暂无分享,去创建一个
[1] W. Rudin. Real and complex analysis , 1968 .
[2] Ernst-Erich Doberkat. Some observations on the average behavior of heapsort , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[3] Edmund Taylor Whittaker,et al. A Course of Modern Analysis , 2021 .
[4] Thomas Porter,et al. Random insertion into a priority queue structure , 1974, IEEE Transactions on Software Engineering.
[5] F. de P. Hanika,et al. Introduction to Operating System Design , 1976 .
[6] G. Darboux,et al. Mémoire sur l'approximation des fonctions de très-grands nombres, et sur une classe étendue de développements en série. , 1878 .
[7] E. Hansen. A Table of Series and Products , 1977 .
[8] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[9] T. A. Bromwich. An Introduction To The Theory Of Infinite Series , 1908 .
[10] E. Bender. Asymptotic Methods in Enumeration , 1974 .
[11] Donald E. Knuth,et al. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .