11 2016 档案

Top K and Quick Selection
摘要：The common solutions for top k problem are heap (priority queue) and quick selection. Using heap is very straight-forward, while quick selection with 阅读全文

posted @ 2016-11-22 02:37 kkkiii 阅读(372) 评论(0) 推荐(0)