Search - hash function

Search - hash function - List

[Data structs] asdcv DL : 0: 利用哈希函数对学生姓名进行最优化查找可选择从键盘输入和文件输入,需输入名字最大长度-hash function to the students find the most optimal choice from the keyboard input and the input document, name must be imported maximum length
Date : 2025-12-16 Size : 1kb User : houny
[Data structs] hash DL : 0: 采用迭代器模式实现hash算法，并自带CPPUNIT测试功能。-Iterator mode used hash algorithm and test function own CPPUNIT.
Date : 2025-12-16 Size : 5kb User : 李国强
[Data structs] HASH DL : 0: 扫描一个C源程序，用Hash表存储该程序中出现的关键字，并统计该程序中的关键字出现频度。用线性探测法解决Hash冲突。设Hash函数为： Hash(key)=[(key的第一个字母序号)*100+(key的最后一个字母序号)] MOD 41-Scan a C source program, using Hash Table to store the keywords appear in the procedure, and statistical procedures in the frequency of the keyword appears. Linear detection method to resolve the conflict Hash. Based Hash function: Hash (key) = [(key the first letter of the serial number)* 100+ (Key serial number of the last letter)] MOD 41
Date : 2025-12-16 Size : 9kb User : zhang
[Data structs] 45678900000000000 DL : 0: 假设人名为中国人姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。哈希函数用除留余数法构造，用伪随机探测再散列法处理冲突。-The assumption that the names of people known as China s Hanyu Pinyin form. Hash table to be populated with the names of a total of 30, taking the average to find the length of the upper limit of 2. Hash function used to stay more than a few laws in addition to construction, using pseudo-random hashing method to detect and then deal with the conflict.
Date : 2025-12-16 Size : 2kb User : yintao
[Data structs] shiyan5 DL : 0: [问题描述] 　　针对某个集体中人名设计一个哈希表，使得平均查找长度不超过R，并完成相应的建表和查表程序。 [基本要求] 　　假设人名为中国人姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。哈希函数用除留余数法构造，用线性探测再散列法或链地址法处理冲突。 -[Description of the problem] for a collective in the design of a hash table names, making the average length of search does not exceed R, and complete the appropriate procedures to build tables and look-up table. [Basic requirements] assumptions of people known as the Chinese name for the Chinese Phonetic Alphabet forms. Hash table to be populated with the names of a total of 30, taking the upper limit of the average search length of 2. Hash function used in addition to stay more than a few law structure, with linear detection or re-hash chain address law deal with the conflict.
Date : 2025-12-16 Size : 2kb User : 飞
[Data structs] datastr DL : 0: C/C++常用的数据结构类包括： array.h：安全数组，可自动增长大小（随机访问，但扩充时效率低） linkedlist.h：普通链表（可随机访问，但访问效率低） dclinkedlist：双向循环链表（不可随机访问，但插入、遍历的效率都比普通链表高） hashtable.h：哈希表（使用键值标识元素，键值一样的元素即认为相等，需重载 == 运算符并由用户定义哈希函数） binstree.h：二叉搜索树（需重载 == 和 < 运算符） avltree.h： AVL 树（需重载 == 和 < 运算符）-C/C++ Commonly used data structure includes: array.h: security array, can automatically increase in size (random access, but when the expansion of low efficiency) linkedlist.h: general list (which can be random access, but the low efficiency ) dclinkedlist: two-way circulation list (non-random access, but the insert, traverse the list of high efficiency than ordinary) hashtable.h: hash table (using the key identity elements, the same key elements that are equally divided, to be Overloading == operator by user-defined hash function) binstree.h: binary search tree (to be overloaded == and
Date : 2025-12-16 Size : 16kb User : sam
[Data structs] hash_functions_src DL : 0: 散列函数源代码,散列表通常是关键字和值对应的数据结构,散列函数用于把关键字映射到相应的数组索引号,由于散列表中每个元素访问到的概率不同,所以应该选用不同的散列函数,以提高程序的查找效率.-Hash function source code, hash table is usually the value of keywords and corresponding data structure, hash function used for the keywords mapped to the corresponding array index number, because each element in the hash table the probability of access to different, so should choose a different hash function in order to improve the efficiency of search procedures.
Date : 2025-12-16 Size : 79kb User : wuzh
[Data structs] hash DL : 0: 设计高效算法往往需要使用Hash链表，常数级的查找速度是任何别的算法无法比拟的，Hash链表的构造和冲突的不同实现方法对效率当然有一定的影响，然而Hash函数是Hash链表最核心的部分，本文尝试分析一些经典软件中使用到的字符串Hash函数在执行效率、离散性、空间利用率等方面的性能问题。-The design of efficient algorithms often need to use the Hash list, find the speed of constant level is unmatched by any other method of, Hash chain structure and conflict to the efficiency of different methods to achieve a certain degree of impact of course, but function is Hash list Hash part of the core, this article attempts to analyze some software to use the classic string of efficiency in the implementation of Hash function, discrete, and space utilization of the performance issues and so on.
Date : 2025-12-16 Size : 18kb User : 李树
[Data structs] hash DL : 0: 查找：建立一个哈希查找表，哈希函数采用: 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.
Date : 2025-12-16 Size : 69kb User : 奈奈
[Data structs] Hash DL : 0: 1. 本程序是针对“人名”设计的哈希表。 2. 程序中人名为汉语拼音形式，共30个人名，取平均查找长度的上限为2.哈希函数用除留余数法构造，用伪随机探测再散列法处理冲突。 3. 本程序以用户和计算机的对话方式执行，即在计算机终端上显示“提示信息”之后，由用户在键盘上输入程序中规定的运算命令；相应的输入数据（滤去输入中的非法字符）和运算结果显示在其后。4.本程序是清华严蔚敏配套哈希表程序-1. This program is for " names" design of the hash table. 2. Program human form, called pinyin, a total of 30 names, taking the average search length of the upper limit of 2. Hash function to remain with the addition of more than a few law structure, with the pseudo-random hashing method to detect and then deal with conflict. 3. The procedure for the user and the computer implementation of dialogue, that is displayed on the computer terminal, " tips" after the keyboard input by the user specified in the computing process orders the corresponding input data (filtered input of illegal characters ) and the results showed that in a subsequent operation. 4. This procedure is Tsinghua Yan Wei-min matching hash table program
Date : 2025-12-16 Size : 7kb User : lt
[Data structs] Hash DL : 0: 试构造一个算法，从键盘输入一组关键字，按哈希函数H(key) = key MOD 13和链地址法处理冲突构来造哈希表,能对关键字进行查找并显示。如(19,14,23,1,68,20,84,27,55,11,10,79,33). -Try to construct a method, a set of keywords from the keyboard, press the hash function H (key) = key MOD 13 and the address of the treatment chain to create the hash table structure conflict, can keyword search and display. If (19,14,23,1,68,20,84,27,55,11,10,79,33).
Date : 2025-12-16 Size : 2kb User : 王玉珏
[Data structs] RK DL : 0: 实验RK算法，即利用Hash方法和素数理论，首先定义一个Hash函数（hash (r) = r mod q），然后将模式串P和文本串T中长度为m的子串利用Hash函数转换成数值。显然只需比较那些与模式串具有相同Hash函数值的子串。当然因为Hash冲突的存在，还要进一步进行字符串比较，但只要选择适当的素数q, Hash冲突的概率就会很小 -Experimental RK algorithm, namely the use of Hash methods and prime number theory, first of all define a Hash Function (hash (r) = r mod q), then the pattern string P and text string T of length m substring using Hash function to convert values . Clearly only those with the pattern string comparison Hash function values ??with the same substring. Of course, the existence of the conflict because of Hash, but also further string comparison, but as long as selecting the appropriate prime q, Hash is very small the probability of conflict
Date : 2025-12-16 Size : 213kb User : chenb
[Data structs] Hash DL : 1: 哈希表用链地址法解决冲突：（哈希函数是按名字第一个大写字母分的）输入内容：学生的姓名跟成绩操作：插入、修改、查找、删除学生；以及输出哈希表-Address hash table with the chain method to solve the conflict: (hash function is based on the name of the first capital letter points) input: the names of students with scores operation: insert, modify, search, delete students and output hash table
Date : 2025-12-16 Size : 101kb User : 许许
[Data structs] Hash-table DL : 0: 哈希表数据结构课程设计 1.1问题描述针对自己的班集体中的“人名”设计一个哈希表，使得平均查找长度不超过R，完成相应的建表和查表程序。 1.2基本要求假设人名为中国姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。构造哈希函数，用链表法处理冲突。 1.3测试数据读取熟悉的30个人的姓名作测试。-Hash table Data Structure Course Design 1.1 Description of the problem For their own class group of the "names" to design a hash table, making the average search length does not exceed R, the completion of construction of tables and look-up table corresponding procedures. 1.2 Basic requirements Assuming the name of the person called Chinese pinyin form. To be filled into a hash table names a total of 30, taking the average search length of the upper limit of 2. Construct a hash function, treatment with a list of conflict. 1.3 Test Data Read the familiar names of 30 individuals tested.
Date : 2025-12-16 Size : 124kb User : lynne
[Data structs] hash DL : 0: 利用hash函数将关键字的key值算出，先检验hash表中key位置是否有关键字。如果没有，则将关键字赋给其关键字域。如果有，则先检验其关键字域的关键字是否与捕捉到的关键字相同。如果相同，只需将关键字的出现次数加1就行了。如果不相同，就依次往后面检验，直到出现相同的关键字，只需将hash表中的冲突域加上循环的次数，出现域加1即可。如果遍寻hash表后都没有找到与之相同的，则要插入一个新的节点-The use of hash function the key key value calculated, the first test table in hash key position if there is a keyword. If not, then the key is assigned to the keyword domain. If there is, then examine its keyword domain keywords and capture the keywords in the same. If the same, only the keyword occurrences plus 1 on the line. If not the same, in turn towards the back of inspection, until the emergence of the same keyword, only the hash table in a collision domain plus the number of cycles, add 1 to appear domain. If the searched hash form did not find the same, to insert a new node
Date : 2025-12-16 Size : 2kb User : 晨夕
[Data structs] hash DL : 0: c语言实现的哈希表。哈希函数使用除留余数法，处理哈希冲突使用连地址法。包含设计文档！在dev c++平台上已验证成功-The C language implementation of the hash table. Hash function used division method, processing method using hash conflict even address. Contains design documents! In dev c++ platform has been successfully validated
Date : 2025-12-16 Size : 18kb User : 郭帅
[Data structs] Hash-Design- DL : 0: ACM论文，关于hash函数的的设计及优化，可以作为ACM竞赛方面的参考~-ACM paper, the design and optimization of the hash function, can be used as a reference of the ACM in competitions ~
Date : 2025-12-16 Size : 57kb User : SZ
[Data structs] Hash-table DL : 0: 本代码主要实现了哈希表的设计，完成了哈希函数的相关要求。-The code is designed to achieve a hash table, the completion of the relevant requirements of the hash function.
Date : 2025-12-16 Size : 2kb User : yangguotao
[Data structs] hash DL : 0: 字符串Hash函数各种方法及各种哈希函数的C语言程序代码-C language code string Hash functions in various ways and various hash function
Date : 2025-12-16 Size : 2kb User : wuleizhihen
[Data structs] 9、Hash表应用 DL : 0: 散列表（Hash table，也叫哈希表），是根据关键码值(Key value)而直接进行访问的数据结构。也就是说，它通过把关键码值映射到表中一个位置来访问记录，以加快查找的速度。这个映射函数叫做散列函数，存放记录的数组叫做散列表。(A hash table (Hash table, also called hash table) is a data structure that accesses directly according to the key code value (Key value). That is to say, it accesses the record by mapping key code values to a location in the table to speed up the search. This mapping function is called a hash function, and an array of records is called a hash table.)
Date : 2025-12-16 Size : 254kb User : 飞洒吧year

« 12 3 »