资源列表
Experiment
- 约瑟夫环问题,N个人围成一圈，报数，数到M的人退出。求出出列序号，-joseph
HuffmanOptimalbinarytree
- 利用Huffman算法，构造最优二叉树，它是霍夫曼编码的基础。-Huffman algorithm is used to construct optimal binary tree, which is the basis of Huffman coding.
3-8-1
- 把10进制的整数和小数转换成二进制整数和小数-dddddddddd
quick.c.tar
- enhanced quick-sort algorithm with c
main
- 二叉树的递归中序遍历 数据结构和算法作业的小程序-Recursive in order traversal of binary tree data structures and algorithms operating in the small program
using-adjacent-matrix-to-store-graph
- 用C语言数据结构描述的演示用邻接矩阵存图的小程序-Described in C language data structures stored adjacency matrix of graph presentation with a small program
1115_001
- It is a bubble sort code.And show the result if the sort is done.Except it will show the result of three value if there is two same value at the end value, that it will show four value.Because the last two value is same.
JSlider-Example
- javaslidercode for java beginner
Binary-search
- 二分查找，递归算法，按字典顺序排好的n个字符串，查找给定的字符串，成功返回索引值，失败返回-1；-Binary search (recursive algorithm)
Queen
- 八皇后的c++实现怎么能写出20个字的描述呢-Eight queen c implementation
ha
- 假设哈希表长为m，哈希函为H(x)，用链地址法处理冲突，试编写输入一组关键字并建造哈希表的算法。-Suppose the hash table length m, the hash function as H (x), treatment with a chain address the conflict and try to enter a keyword and the preparation of the construction of hash table algorithm.
binsrch
- 设a[0:n-1]是一个已排好序的数组。请改写二分搜索算法，使得当搜索元素x不在数组中时，返回小于x的最大元素的位置I和大于x的最大元素位置j。当搜索元素在数组中时，I和j相同，均为x在数组中的位置-binsrch