摘要：
MAKE-SET.x/ creates a new set whose only member (and thus representative) is x. Since the sets are disjoint, we require that x not already be in some 阅读全文
posted @ 2017-07-06 16:17 Wujunde 阅读(397) 评论(0) 推荐(0) 编辑
摘要：
van Emde Boas trees 支持所有优先级优先级队列的操作，并且巧妙的是它对于SEARCH, INSERT,DELETE,MINIMUM,MAXMUN,SUCCESSOR,和PREDECESSOR这些操作的支持都在最坏复 杂度O(lglgn)之内。不过有些限制的是，所有的Kye值都必须在 阅读全文
posted @ 2017-06-28 20:11 Wujunde 阅读(963) 评论(0) 推荐(0) 编辑
摘要：
Mergeable heapsA mergeable heap is any data structure that supports the following five operations,in which each element has a key:MAKE-HEAP./ creates 阅读全文
posted @ 2017-06-28 15:02 Wujunde 阅读(203) 评论(0) 推荐(0) 编辑
摘要：
B-trees are balanced search trees designed to work well on disks or other direct accesssecondary storage devices. B-trees are similar to red-black tre 阅读全文
posted @ 2017-06-28 15:02 Wujunde 阅读(273) 评论(0) 推荐(0) 编辑
摘要：
present a file by binary character code,let the less characters can be presented simplier. 阅读全文
posted @ 2017-06-25 01:25 Wujunde 阅读(168) 评论(0) 推荐(0) 编辑
摘要：
many activities will use the same place, every activity ai has its' start time si and finish time fi.let the number of activities to be as many as pos 阅读全文
posted @ 2017-06-24 14:01 Wujunde 阅读(208) 评论(0) 推荐(0) 编辑
摘要：
to calculate the min step of multiplicate some matixs 阅读全文
posted @ 2017-06-21 22:47 Wujunde 阅读(253) 评论(0) 推荐(0) 编辑
摘要：
for a rod of length i the price of it si pi,to cut the rod to earn more money 阅读全文
posted @ 2017-06-21 22:42 Wujunde 阅读(160) 评论(0) 推荐(0) 编辑