2017年8月2日
Coursera Algorithms week3 快速排序 练习测验: Decimal dominants（寻找出现次数大于n/10的元素）
摘要： 题目原文： Decimal dominants. Given an array with n keys, design an algorithm to find all values that occur more than n/10 times. The expected running time 阅读全文
posted @ 2017-08-02 14:51 evasean 阅读(1423) 评论(0) 推荐(0) 编辑
Coursera Algorithms week3 快速排序 练习测验: Selection in two sorted arrays（从两个有序数组中寻找第K大元素）
摘要： 题目原文 Selection in two sorted arrays. Given two sorted arrays a[] and b[], of sizes n1 and n2, respectively, design an algorithm to find the kth larges 阅读全文
posted @ 2017-08-02 14:32 evasean 阅读(932) 评论(0) 推荐(1) 编辑