06 2017 档案

Van Emde Boas Tree

摘要：van Emde Boas trees 支持所有优先级优先级队列的操作，并且巧妙的是它对于SEARCH, INSERT,DELETE,MINIMUM,MAXMUN,SUCCESSOR,和PREDECESSOR这些操作的支持都在最坏复 杂度O(lglgn)之内。不过有些限制的是，所有的Kye值都必须在 阅读全文

posted @ 2017-06-28 20:11 Wujunde 阅读(1040) 评论(0) 推荐(0)

Fibonacci Heaps

摘要：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 阅读(224) 评论(0) 推荐(0)

B-trees

摘要：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 阅读(302) 评论(0) 推荐(0)

huffman(greedy)

摘要：present a file by binary character code,let the less characters can be presented simplier. 阅读全文

posted @ 2017-06-25 01:25 Wujunde 阅读(174) 评论(0) 推荐(0)

activity select problem(greedy algorithms)

摘要：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 阅读(222) 评论(0) 推荐(0)

matrix_chain_order

摘要：to calculate the min step of multiplicate some matixs 阅读全文

posted @ 2017-06-21 22:47 Wujunde 阅读(262) 评论(0) 推荐(0)

rod cutting

摘要：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 阅读(178) 评论(0) 推荐(0)

the implemention of redblack tree

摘要：1 public class redbalcktree { 2 3 private class Node{ 4 private int val; 5 private int key; 6 boolean color; //black true 7 pri... 阅读全文

posted @ 2017-06-12 23:34 Wujunde 阅读(152) 评论(0) 推荐(0)

the principle of redbalck tree

摘要： 阅读全文

posted @ 2017-06-12 23:22 Wujunde 阅读(111) 评论(0) 推荐(0)

binarysearchtree

摘要：1 public class binarytree { 2 private Node root = null; 3 private class Node{ 4 private Value val; 5 private int key; 6 private N... 阅读全文

posted @ 2017-06-11 22:17 Wujunde 阅读(119) 评论(0) 推荐(0)

opendressinghash //use resize array

摘要：1 public class opendressinghash { 2 private static final int INIT_CAPACITY = 4; 3 4 private int n; 5 private int m; 6 private Key[] ke... 阅读全文

posted @ 2017-06-11 22:15 Wujunde 阅读(181) 评论(0) 推荐(0)

three probing way of openadress hash

摘要： 阅读全文

posted @ 2017-06-11 22:12 Wujunde 阅读(124) 评论(0) 推荐(0)

ChainingHash

摘要：public class ChainingHash{ private int N; private int M; private doublylinked[] s; public ChainingHash(int M){ this.M = M; s = new doublylinked [M]; for(int i=... 阅读全文

posted @ 2017-06-11 22:08 Wujunde 阅读(154) 评论(0) 推荐(0)

Hash function

摘要：h(k) = k mod m When using the division method, we usually avoid certain values of m. Forexample, m should not be a power of 2, since if m^2p, then h(k 阅读全文

posted @ 2017-06-11 01:07 Wujunde 阅读(231) 评论(0) 推荐(0)

stack && queue

摘要：package elementary_data_structure; import java.util.Iterator;import java.util.NoSuchElementException; public class stack<Item> implements Iterable<Ite 阅读全文

posted @ 2017-06-08 23:09 Wujunde 阅读(147) 评论(0) 推荐(0)

random_select

摘要：package sorttest; //expected and worst running time is O(n),asuming that the elements are distinct import java.util.Random; public class random_select 阅读全文

posted @ 2017-06-07 22:55 Wujunde 阅读(435) 评论(0) 推荐(0)

counting sort

摘要：public class counting_sort { //O(n) it is stable(numbers with the same value appear in the output array in the same order as they do in the input //ar 阅读全文

posted @ 2017-06-06 20:46 Wujunde 阅读(113) 评论(0) 推荐(0)

master theorem

摘要：The master theorem concerns recurrence relations of the form: In the application to the analysis of a recursive algorithm, the constants and function 阅读全文

posted @ 2017-06-03 23:13 Wujunde 阅读(279) 评论(0) 推荐(0)

各排序算法及其比较

摘要：heap:// worst: O(n*lgn) public class heap { public static void sort(int[]a){ int b[] = copy(a); int N = b.length-1; for(int k = N/2;k > 0;k--){ sink(b 阅读全文

posted @ 2017-06-03 21:56 Wujunde 阅读(142) 评论(0) 推荐(0)

Strassen algorithm(O(n^lg7))

摘要：Let A, B be two square matrices over a ring R. We want to calculate the matrix product C as If the matrices A, B are not of type 2n × 2n we fill the m 阅读全文

posted @ 2017-06-02 22:07 Wujunde 阅读(338) 评论(0) 推荐(0)

dynamic programming：find max subarray

摘要：public static mark dynway( ) //put or pop the books into the basket,mark the highest recorder { int Sum,Max; int lom = -1; int him = -1; boolean star 阅读全文

posted @ 2017-06-02 19:24 Wujunde 阅读(152) 评论(0) 推荐(0)

divide&conquer:find max array

摘要：package max_subarrayy;import java.lang.Math;public class max_subarrayy { private static int[] array; public static class mark{ private int lom = 100; 阅读全文

posted @ 2017-06-01 14:31 Wujunde 阅读(203) 评论(0) 推荐(0)

三个数字的比较

摘要：return (max(d1, d2) > d3) ? max(d1, d2) : d3; 阅读全文

posted @ 2017-06-01 12:54 Wujunde 阅读(117) 评论(0) 推荐(0)