实现heap排序的算法，首先把Heap建立起来，然后通过对Heap的根节点来找出当前最小的节点，依次就可以实现排序了。-achieve heap sorting algorithm to first establish Run, then Run right through the current nodes to identify the smallest nodes can be followed to achieve the ranking.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001465s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.086373s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001104s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001274s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000998s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003469s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001191s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.004009s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.018564s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001384s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 126322 [ RunTime:0.014319s ]
