%0 Journal Article
%T OPTIMAL ALGORITHM OF HEAPSORT<br>堆整序的最优算法
%A Gu Xunrang
%A Zhu Yuzhang
%A <br>顾训穰
%A 诸宇章
%J 软件学报
%D 1994
%I 
%X A new heapsort algorithm is given in this paper. Its practical value is that the efficiency of it is two times as high as that of the former algorithm.Also,its theoretical significance lies in the order and the main term coefficient of the complexity being of optimal performance.
%K Heap
%K sorting by comparision
%K algorithm
%K computational complexity<br>堆
%K 比较整序
%K 算法
%K 计算杂性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=D3455F18D150096A45DA92AF70E7746B&yid=3EBE383EEA0A6494&vid=94C357A881DFC066&iid=CA4FD0336C81A37A&sid=27746BCEEE58E9DC&eid=933658645952ED9F&journal_id=1000-9825&journal_name=软件学报&referenced_num=2&reference_num=5