Description: 为了实现RTP数据重组,写了双指针链表,类似动态hash表(网上资料太少了),有添加(自动排序),删除和清除.我还在扩展功能-RTP data in order to achieve the reorganization, wrote a two-pointer List, similar dynamic hash table (online so little information), add (automatic sorting), delete and remove. I also expanded Platform: |
Size: 10064 |
Author:llg |
Hits:
Description: 为了实现RTP数据重组,写了双指针链表,类似动态hash表(网上资料太少了),有添加(自动排序),删除和清除.我还在扩展功能-RTP data in order to achieve the reorganization, wrote a two-pointer List, similar dynamic hash table (online so little information), add (automatic sorting), delete and remove. I also expanded Platform: |
Size: 10240 |
Author:llg |
Hits:
Description: <算法导论>第二版大部分算法实现.
1. 各类排序和顺序统计学相关
2. 数据结构
2.1 基本数据结构
2.2 散列表
2.3 二叉查找树
2.4 红黑树
2.5 数据结构基于红黑树的扩张
3. 高级涉及和分析技术
3.1 动态规划相关
3.2 贪心算法相关
3.3 用于不相交集合的数据结构
4. 部分图算法.-<Introduction to Algorithms> Algorithms realize most of the second edition of .1. All kinds of sorting and order statistics related to 2. Data Structure 2.1 Basic Data Structure 2.2 Hash Table 2.3 Binary search Tree 2.5 Tree 2.4 red and black red and black tree-based data structure the expansion of 3. High and analytical techniques involving dynamic programming related 3.1 Greedy Algorithm 3.2 for the relevant 3.3 Disjoint Set Data Structure 4. part of Fig algorithm. Platform: |
Size: 324608 |
Author:QJGui |
Hits:
Description: 1.（若知道进程号，那么可以通过HASH 表很快地找到该进程）2调度程序的提.3.(用户空间和内核空间动态内存-1. (If so, its process, then HASH table can quickly find the process) 2 scheduling procedures to .3. (User space and kernel space dynamic memory Platform: |
Size: 3072 |
Author:soulpower |
Hits:
Description: 数据结构和算法，非常经典，讲的很详细！第一部分 基础知识
第一章 C++程序设计
第二章 程序性能
第二部分 数据结构
第三章 数据描述
第四章 数组和矩阵
第五章 堆栈
第六章 队列
第七章 跳表和散列
第八章 二叉树和其他树
第九章 优先队列
第十章 竞赛树
第十一章 搜索树
第十二章 图
第三部分 算法设计方法
第十三章 贪婪算法
第十四章 分而治之算法
第十五章 动态规划
第十六章 回溯
第十七章 分支定界-Data structures and algorithms, very classic, talked in great detail! The first part of the basic knowledge of first chapter C++ Program Design Chapter II The second part of the data structure of program performance data described in Chapter III Chapter IV Chapter V array and matrix stack, queue, Chapter VI Chapter VII Chapter VIII of the jump table and the hash Binary trees and other tree priority queue IX Chapter X Chapter XI competition tree search tree diagram the third part of Chapter XII Chapter XIII greedy algorithm design method of divide and conquer algorithms Chapter XIV Chapter XV of the dynamic programming algorithm for 16th Chapter XVII Chapter backtracking branch and bound Platform: |
Size: 17229824 |
Author:孙继磊 |
Hits:
Description: 、实验目的
1 熟练掌握各种内排序方法，深刻理解排序算法及其执行过程；
2 学会分析各种内排序算法的性能；
3 了解各种排序方法的优缺点，对于实际问题能够选择一种较好的排序方案；
4 熟练掌握图的存储结构；
5 掌握图的邻接矩阵和邻接表表示分别进行深度和广度优先搜索遍历的算法。
6 了解图的最小生成树算法。-Proficiency in the order of search, binary search and index search basic search algorithm, these algorithms are familiar with what kind of storage structure suitable for implementation two master binary sort tree characteristics, building methods, and dynamic search algorithm 3 master hash table of characteristics and construction methods. Platform: |
Size: 3072 |
Author:zhangge |
Hits:
Description: 基于LZW字典编码的压缩解压算法，动态建立编译表并用哈希表结构存储索引。-Dictionary-based LZW compression decompression coding algorithm, dynamic compilation table set up and use the hash table structure to store the index. Platform: |
Size: 2048 |
Author:戴理 |
Hits:
Description: 散列表。它通过把关键码值映射到表中一个位置来访问记录，以加快查找的速度。这个映射函数叫做散列函数，存放记录的数组叫做散列表。在理想情况下，查找、插入、删除操作的时间均为O(1)，是一种高效的动态集合结构。-Hash table. It to access records by key value mapped to a table in a position to accelerate the lookup speed. This mapping function called a hash function to store the recorded array called a hash table. Ideally, search, insert, delete operation time are O (1), is a highly dynamic set of structures. Platform: |
Size: 1024 |
Author:juwairen |
Hits:
Description: 基于查找表的单词检索软件，设计与实现静态查找表、基于二叉排序树的动态查找表及HASH表等三种中的任意两种查找表结构及其抽象数据类型；以一本英文电子书（如英文小说，科普读物或圣经之类的社会书籍，书的篇幅不少于2万次单词）作为单词文本数据来源，使用上述查找表ADT，通过读取电子书而建立对应的两种查找表，以单词作为关键字，单词在书籍中出现的次数及每次出现的页码，行号等信息作为查找表数据元素属性；通过理论与实际测试结果对比分析两种查找表性能。(The design and implementation of static lookup table, based on the two binary sort tree dynamic lookup table and HASH table three in any two lookup table structure and abstract data types; one of the English books (such as English novels, such as social science books or Bible books, book of not less than 20 thousand words) as the word text data source, using the look-up table ADT, and set up two to find the corresponding table by reading books, with the word as a keyword, page number and each word in the book appear, line number and other information as a lookup table of data element attribute; by comparing the theoretical and practical analysis of the test results of two kinds of lookup table performance.) Platform: |
Size: 14787584 |
Author:aliiiim
|
Hits:
Description: 本书示例丰富,图文并茂,以简明易懂的方式阐释了算法,旨在帮助程序员在日常项目中更好地利用 算法为软件开发助力。前三章介绍算法基础,包括二分查找、大 O 表示法、两种基本的数据结构以及递归 等。余下的篇幅将主要介绍应用广泛的算法,具体内容包括 :面对具体问题时的解决技巧,比如何时采用 贪婪算法或动态规划 ;散列表的应用 ;图算法 ;K 最近邻算法。
本书适合所有程序员、计算机专业相关师生以及对算法感兴趣的读者(This book is rich in examples and illustrates algorithms in a concise and easy-to-understand way. It aims to help programmers make better use of algorithms in daily projects to help software development. The first three chapters introduce the basic algorithms, including binary search, large O representation, two basic data structures and recursion. The rest of the paper will focus on the widely used algorithms, including: when to use greedy algorithm or dynamic programming, hash table application, graph algorithm, K nearest neighbor algorithm when facing specific problems.
This book is suitable for all programmers, computer-related teachers and students, and readers interested in algorithms.) Platform: |
Size: 16691200 |
Author:辉-triste |
Hits:
Search - dynamic hash table