理学 排序算法 释 heapsort 堆排序 堆是一种近似完全二叉树的结构，并同时满足堆的性质：即子结点的键值或索引总是小于（或者大于）它的父节点。堆排序是指利用堆这种数据结构所设计的一种排序算法。
heapsort 堆排序
理论计算机科学 算法设计与分析 释文 heap sort 堆排序
- Official Selection System
- Officials of Palaces and Temples
- officials of Shang
- Official's Salary (in Feudal Times)
- officials with families abroad
- officials within the ranks
- officials’ incentives
- official veterinarian
- official Website
- official working language
- officinal magnolia bark
- Off-job Training
- off-label drug use
- off line
- offline
- off-line analysis
- offline backup
- offline charging
- offline clothing market
- off-line composite
- off line data analysis
- off-line data analysis
- off-line electronic patrol system
- off-line encryption
- off-line equipment