随笔分类 -  Algorithm

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 阅读(166) 评论(0) 推荐(0)
【坑】 Quick Select
摘要：To solve the "Find K nearest Points" problem. O(n) time complexity 阅读全文
posted @ 2017-07-27 04:00 grainy 阅读(120) 评论(0) 推荐(0)
Combinatorial Games
摘要：http://www.cs.cmu.edu/afs/cs.cmu.edu/academic/class/15251-f07/Site/Materials/Lectures/Lecture02/lecture02.pdf 阅读全文
posted @ 2017-07-26 14:55 grainy 阅读(200) 评论(0) 推荐(0)