X[0:n-1]和Y[0:n-1]为2个数组,每个数组中含有n个已排好序的数。
试设计一个O(log n)时间的算法,找出X和Y的2n个数的中位数。-X [0: n-1] and Y [0: n-1] for the two arrays, each array contains n have lined up a number sequence. Try to design a O (log n) time algorithm to find X and Y number of 2n median.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001231s ]
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.125542s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001173s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001936s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001167s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003688s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001000s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003181s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.016977s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001390s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 174022 [ RunTime:0.000921s ]
