该程序实现对一维数据轴上的最临近点的求解问题 采用方法：分治方法(找出中位数,两边递归）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : the administration (to identify the median on both sides, the recursive)
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.000911s ]
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.079093s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001022s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001154s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000963s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003052s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000900s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003695s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014701s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001204s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 125841 [ RunTime:0.030507s ]
