Search - Dynamic Binary Search Algorithm

Search - Dynamic Binary Search Algorithm - List

[Data structs] AlgorithmUsingJava DL : 0: <算法导论>第二版大部分算法实现. 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.
Date : 2025-12-20 Size : 317kb User : QJGui
[Data structs] c2008 DL : 0: 这里面有二分查找、进制转换、数据结构、货郎担算法、动态网络最短路线等等很多很多的程序-There are binary search, binary conversion, data structure, traveling salesman algorithm, dynamic shortest route network and so on many, many procedures
Date : 2025-12-20 Size : 309kb User : 陈胜
[Data structs] src DL : 0: PKU中一些数据结构基本算法题的java实现，包括DIJ、PRIM、二叉查找树、并查集、动态规划、KMP、匈牙利算法、深搜广搜等-PKU some basic data structure algorithm java realization of the title, including DIJ, PRIM, binary search tree, and search sets, dynamic programming, KMP, the Hungarian algorithm, collected, such as deep-search
Date : 2025-12-20 Size : 76kb User : 俞昊旻
[Data structs] DataStructureAlgorithm DL : 0: 数据结构和算法，非常经典，讲的很详细！第一部分基础知识第一章 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
Date : 2025-12-20 Size : 16.43mb User : 孙继磊
[Data structs] tu DL : 0: 、实验目的 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.
Date : 2025-12-20 Size : 3kb User : zhangge
[Data structs] chengxu DL : 0: 查找算法实现与性能分析要求：（1）数据结构的定义（2）静态查找算法（顺序，折半）实现（3）动态查找实现(二叉排序树建立、查找) （4）性能分析(用大批量数据测试算法的执行时间) -Search algorithm and performance analysis of requirements: (1) data structure definition (2) static search algorithm (the order of half) (3) dynamic lookup (binary sort tree to create, find) (4) Performance Analysis (with large bulk data test the algorithm execution time)
Date : 2025-12-20 Size : 18kb User : 汤艳荣
[Data structs] OBST DL : 0: 尝试用贪心算法和动态规划算法构造最优二叉搜索树，并做基本统计分析和比较。结论是贪心算法不能保证构造出最优，也没有好的效率；动态规划明显更好。-Use greedy algorithm and dynamic programming to build optimal binary search tree. And related statistics and comparison are provided in report.
Date : 2025-12-20 Size : 500kb User : 李进
[Data structs] algorithms-master DL : 0: 1. 经典的算法实现 2. 服务器端 3. 正确，易于使用和改造, 一个头文件一个算法，并附带一个demo. 1. 一个算法用一个.h文件表示放到include下.2. 算法演示的demo程序放到src下.3. 程序正确通过后，请发起Pull Requests，代码被验证后入库，并在README中发布新算法实现。已实现 ( Implemented ): Array shuffle Prime test(trial division) Prime test(Miller-Rabin s method) 2D Array Arbitary Integer Linear congruential generator Maximum subarray problem Bit-Set Queue Stack Binary Heap Fibonacci Heap Priority Queue (list based) Bubble sort Selection sort Insertion sort Radix sort Quick sort Merge sort Heap sort Double linked list Skip list Self-organized linked-list ops (move-to-front, move-ahead-one) Largest common sequence Binary search tree Dynamic order statistics Red-black tree Interval tree Prefix Tree(Trie) Suffix Tree B-Tree Suffix Array等-(classical algorithms implementations) (based on linux/gcc) (correct! and ease of use, one .header file per algorithm) one .header file per algorithm. )( one demo per algorithm. )(Please Use Fork+Pull Requests !!! Correctness is the most important!)
Date : 2025-12-20 Size : 1.56mb User : 汪小君