搜索资源列表
optimalBinarySeachTree
- Build an optimal binary search tree using dynamic programming.-Build an optimal binary search tree using d ynamic programming.
txt
- 用二叉链表做存储结构，输入键值序列，建立一棵二叉排序树并在二叉排序树上实现查找算法。-To do with binary storage structure list, enter the key sequence, set up a binary sort tree and binary search algorithm to sort the tree implementation.
assign13
- this is for binary search programming
bst
- binary search tree in c
bstree.tar
- this a binary search tree implementation including some operations. Have fun.-this is a binary search tree implementation including some operations. Have fun.
mmtrie
- 写这个的出发点是吧之前做的trie能写到文件而且能很容易mmap到内存, 可以用于输入法 搜索引擎分词 词表的功能, 共享前缀存储, 支持最大２０亿节点. 简单一点可以当一个hash表使用, 查找的时间复杂度为 N* Log(256) N为字符长度, key可以为二进制的数据, value 必须为int类型, 不能为０, 因为mmtrie_get()/find() 没有结果的情况下为０, 如果需要set value为０的话自己+１, 出来的时候-１就好了.-Write the start
OptimalBST
- 最优二叉搜索树的构建，动态规划实现。gcc编译通过，可将构建好的树以列表的形式打印出来。-Optimal binary search tree construction, Dynamic Programming. gcc compile.
myvtree
- 此源码实现了二叉搜索树的生成及输出排序后的结果-This source code implements a binary search tree generation and output the results sorted
zhebanchazhaofa
- 自己用c语言写的一个折半查找法的相关介绍以及用一般查找法的对比。-Write their own language with c a binary search method to find related presentations and using the general method of comparison.
A-Fast-Binary-Search-Anti-collision-Algorithm-for
- this document is a source for rfid anti-collision algorithm in multi-tag systems. this algorithm is based on aloha protocol that is very popular today beacuse of it easiness and simplification. such protocol has used in all active RFID designs.
abstract-data-types
- In this homework, we are going to implement various ADTs including “doubly linked list”, “dynamic array” and “binary search tree”. Based on the parameter to the “make” command, we will generate 3 different executables: “adtTest.dlist”, “adtTest
binary-tree
- 二叉树的创建，二叉树中结点的查找，测二叉树的深度宽度，输出二叉树的叶子结点-Binary tree creating, search binary tree node , the binary tree s depth and width, output binary tree leaf nodes
adt-tree
- 二叉排序树：又称二叉查找树。 它或者是一棵空树；或者是具有下列性质的二叉树： （1）若左子树不空，则左子树上所有结点的值均小于它的根结点的值； （2）若右子树不空，则右子树上所有结点的值均大于它的根结点的值； （3）左、右子树也分别为二叉排序树；-Binary sort tree: also known as binary search tree. Or an empty tree or a binary tree with the following properties: (1) If t
TreeToList
- 将二叉搜索树变为双向链表，先序遍历输入节点，输出双向链表-The binary search tree into a doubly linked list, doubly linked list of the preorder traversal of the input node, output
erfenchazhao
- 经典查找算法之二分查找，对大家很有用的，因为这是一个系列-The classical Find algorithm of binary search
binary
- binary search c source code
bsearch
- A generic implementation of binary search for the Linux kernel.
csrsbcs
- Binary search for value in table, which must have exactly 64 entries.
search
- 本程序实现了 各种查找算法，主要是几个版本的二分查找和顺序查找，并给出接口进行各种算法的比较。-This program implements a variety of search algorithms, mainly several versions of binary search and sequential search, and gives a comparison of various algorithms interface.
Two-insert-search-tree
- 包含查找最大值、最小值的二叉搜索树方法，程序简洁明了-Binary search tree method comprising find the maximum, minimum, clear and concise program