搜索资源列表
等级证书考试管理系统
- 用C语言或其他高级语言编程(最好C语言),基本功能：包括报名管理、成绩管理、证书管理等。能做到考试的报名成绩的录入与查询以及证书的发放等功能。实现有关功能的增加、修改、删除、查询和统计模块。根据要求知道，一个学生报名后就拥有唯一的考号，考号随着 考生取消报名而消失，所以可以以考号为Key来实现查找学生记录，实现有关功能的增加、修改、删除、查询.-C language or other high-level programming language (preferably C), the ba
平衡二叉树操作的演示
- 平衡二叉树实现一个动态查找表,有三种基本功能:查找,插入删除,还有选项功能:合并两棵平衡二叉树,和分裂两棵平衡二叉树.-balanced binary tree to achieve a dynamic lookup table, there are three basic functions : to find, delete, insert, functional options : merging two balanced binary tree, and split two balanc
060626
- 哈希表设计 针对某个集体中人名设计一个哈希表，使得平均查找长度不超过R，并完成相应的建表和查表程序。-Hash Table design is a design collective Names Hash Table 1, bringing the average length not exceeding find R, and completion of the corresponding construction and Lookup Table procedures.
findsjjg
- 实验目的：掌握静态查找表的基本操作，并实现一个简单的信息管理问题。 实验要求：1、上机运行程序。 2、分析代码。 3、重写代码。 -experiment : static lookup table grasp the basic operation and the realization of a simple message management issues. Experimental requirements : one, operational procedures
ClosestPairPoint
- 实现查找一组给定点中的最近点对，通过分治方法将问题求解，简化问题的复杂性。-Lookup a group to the latest sentinel points right, adoption of the partition method of problem solving, simplifying the complexity of the problem.
索引顺序表的查找源程序代码
- 数据结构上机实验内容 索引顺序表的查找源程序代码-data structure on the plane experiment content indexing table lookup sequence source code
TRIE
- 字典树，实现字典树的插入删除查找功能。效率高-Dictionary tree, insert the tree removed to achieve a dictionary lookup function. Efficient
MurmurHash
- mur hash是 Austin Appleby于2008年创立的一种非加密hash算法，适用于基于hash进行查找的场景。murmurhash在多个开源项目中得到应用，包括libstdc、libmemcached、nginx、hadoop等。-MurmurHash is a non-cryptographic hash function suitable for general hash-based lookup. It was created by Austin Appleby in 200
search
- 索引顺序表查找,索引顺序查找即分块查找，是将顺序表分成诺干块。-Indexed sequential table lookup, the index in order to find that the search block is to the order of the table is divided into Nokan blocks.
datastruct
- 包含了二叉树查找法，递归对半查找法，以及非对半查找法。-This packet includes the programe with to fork lookup and recursion or non-recursion half-and-hanf lookup
hash
- 查找： 建立一个哈希查找表，哈希函数采用: H(key)= key P(其中P=13)，若发生冲突后,用链地址法解决冲突。-Search: the creation of a hash lookup table, the use of hash function: H (key) = key P (of which P = 13), if the occurrence of post-conflict, and conflict resolution chain address law.
1
- a．输入一组整型元素序列，建立线性表。 b．实现该线性表的遍历。 c．在该线性表中查找某一元素,查找成功显示查找元素,否则显示查找失败。 d. 在该线性表中删除或插入指定元素。 -a. Enter a group of integer elements in sequence, a linear form. b. To achieve the linear traverse table. c. In the linear search for a particular eleme
haxibiao
- 附有实验报告。。1、查找的基本概念和查找的几种方法以及求查找的平均查找长度。 2、静态查找表（基于线性表的查找法）。顺序查找、二分查找和分块查找。 3、动态查找表（基于树的查找法）。二叉排序树、二叉平衡树、 B_ 树和B+ 树。 -1, find the basic concepts and find several methods, as well as seeking to find the average search length. 2, static lookup tabl
ExtendedHashing.cpp
- this program implements extendible-hashing using tries as lookup-directory. it is more efficient than simple array based implementation-this program implements extendible-hashing using tries as lookup-directory. it is more efficient than simple arra
chazhao
- 查找 1.有序表的查找 2.顺序表的查找 3.哈希表的查找 4.退出程序-1. Ordered the table to find 2. In order to find the table 3. Hash table lookup 4. Exit
data_struct9
- 数据结构课后设计题第九章 9.26② 试将折半查找算法改写成递归算法。 实现下列函数： int BinSearch(SSTable s, int low, int high, KeyType k) 静态查找表的类型SSTable定义如下：-Data structure design question after class IX 9.26 ② would try to rewrite the binary search algorithm int
shanliebiao
- 任务： 设计散列表实现电话号码查找系统。 设每个记录有下列数据项：电话号码、用户名、地址； 1，从键盘输入各记录，分别以电话号码和用户名为关键字建立散列表； 2，采用一定的方法解决冲突； 3，查找并显示给定电话号码的记录； 4，查找并显示给定用户名的记录。 -Task: Design Implementation phone number lookup hash table system. Set for each record the following data
chazhao
- 哈希表的查找。用线性探测在散列的方法建立哈希表，然后对其中的元素进行查找-Hash table lookup. Hashing by linear probing method to establish the hash table, and then find the elements of which
chazhao
- 1:折半查找算法的思想及实现。 2:掌握二叉排序树，AVL树的查找，插入，删除，建立算法的思想及实现 3：存储结构的思想，能选择合适散列函数，实现不同冲突处理方法的散列表的查找，建立 -1: The binary search algorithm and the realization of the idea. 2: The master binary sort tree, AVL tree search, insert, delete, create the idea of the
Hash-table-lookup
- 哈希表查找，一种地址查找，各查找中时间复杂度最小-Hash table lookup, an address lookup, find the time complexity of the minimum