某储备粮的“学习笔记” - CS 240复习总结之三: Sorting and Randomized Algorithms 的评论

某储备粮的“学习笔记” - CS 240复习总结之三: Sorting and Randomized Algorithms 的评论 Comparison-based sorting最优Runtime为Ω(n log n)QuickSelect用QuickSort algorithm快速查找第k大的数 (avg rumtime: Θ... 1970-01-01T08:00:00+08:00 Typecho http://blog.gregwym.info/feed/atom/cs-240-fu-xi-zong-jie-zhi-san--sorting-and-randomized-algorithms.html