- 博客(3)
- 资源 (3)
- 收藏
- 关注
转载 open addressing
1 Overview Open addressing和Chaining是两种不同的解决hash冲突的策略。当多个不同的key被映射到相同的slot时,chaining方式采用链表保存所有的value。而Open addressing则尝试在该slot的邻近位置查找,直到找到对应的value或者空闲的slot, 这个过程被称作probing。常见的probing策略有Linear
2012-12-13 11:13:53 851
原创 Simultaneous minimum and maximum (Solution to algorthm)
if we want to get both the Min and Max number from the unsorted sequence ,and we want it's less than 2n comparisions.so we can get it at most 3(n/2) comparisions;And it is the algorthm followed
2012-12-06 20:50:02 481
转载 Radix Sort
转自:http://www.2cto.com/kf/201211/166745.html通俗理解:结合计数排序,通过对待排数组中元素每一位进行排序,最终达到对整个数组排序的效果。观看动态过程[cpp] #include #include #define MAXK 10 int get_int(void); int count_sort (int*array,in
2012-12-06 09:40:47 499
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人