理学 排序算法 释 heapsort 堆排序 堆是一种近似完全二叉树的结构，并同时满足堆的性质：即子结点的键值或索引总是小于（或者大于）它的父节点。堆排序是指利用堆这种数据结构所设计的一种排序算法。
heapsort 堆排序
理论计算机科学 算法设计与分析 释文 heap sort 堆排序
- earthdin
- earth dynamic ellipticity
- earth dynamics
- earth elasticity
- earth ellipsoid
- earth ellipticity
- earthen and wooden figurines in Turpan
- earthen bowl
- earth fissures
- earth fixed coordinate system
- earth-fixed coordinate system
- earth flattening
- earth forest
- Earth Forest-Guge Scenic and Historic Area
- earth free oscillation
- earthgas nanometal survey
- earthgas survey
- earth-geomagnetic navigation
- Earth God opera
- earth gravitational perturbation
- earth gravity field
- earth gravity potential model
- earth-grazer
- earth-grazing asteroid
- earth, ground