2017年7月27日
Hash Table Collision Handling
摘要： Two basic methods; separate chaining and open address. Separate Chain Hangs an additional data structure off of the buckets. For example the bucket ar 阅读全文
posted @ 2017-07-27 12:12 grainy 阅读(142) 评论(0) 推荐(0) 编辑
【坑】different compare function (priority, vector,...)
摘要： priority_queue<Point, vector<Point>, pqCmp> struct pqCmp { bool operator() (const Point& a, const Point& b) const { return distance(a,center) < distan 阅读全文
posted @ 2017-07-27 04:04 grainy 阅读(123) 评论(0) 推荐(0) 编辑
【坑】 Quick Select
摘要： To solve the "Find K nearest Points" problem. O(n) time complexity 阅读全文
posted @ 2017-07-27 04:00 grainy 阅读(116) 评论(0) 推荐(0) 编辑