Report - 9.1-1 按照竞争树的办法求最小值需 n-1 次比较，然后在 lgn 个与最小值比较过的元素中求出最小值即为原来 n 个元素的次小值，需 lgn-1 次比较，所以共需

Select PornographicDefamatoryIllegal/UnlawfulSpamOther Terms Of Service ViolationFile a copyright complaint

Please pass captcha verification before submit form