搜索资源列表
zhebanchazhao
- 一种基于VC的折半查找方法源代码,对VC初学者有用-a VC-based binary search method source code, useful for beginners VC
shujujiegou__c++
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Binary_Search_Tree
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
tudelinjiebiaobiaoshi
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Kruskal_suanfa
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Binary__Tree
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
AVL___Tree
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Binary-Search
- function Binary_Search(L,a,b,x) begin if a>b then return(-1) else begin m:=(a+b) div 2 if x=L[m] then return(m) else if x>L[m] then
电话本管理系统
- 提高输入容错。判断输入的对错。 时间关系，搜索功能为线性搜索，现增强如下：f_search:费氏查找法；btree:二叉树查找法；l_search：线性查找法； r_search：递归折半查找法；zcsear:杂凑碰撞查找法；o_sear:插补查找加强法； 排序是冒泡法，现增强为：heaps:累堆排序；binary：二叉树排序；xieer：谢耳排序；sinsert：插入排序；quicks:快速排序；select:选择排序法；-increase input fault tolerance. Imp
erfenchzhao
- 数据结构二分查找。。。。。。原代码数据结构课程-Binary search data structure. . . . . . The original source data structure course
binstree
- To learn the representation and implementation of a binary search tree.
BinarySearch
- A program written by C++ which is used to search using binary search concept on parallel processes,,,,wishing it is useful
OBST
- Optimal binary search tr-Optimal binary search tree
FOJ
- 向量距离，二叉搜索堆，树的先后中序，-Vector distance from the binary search heap, one after another in the sequence tree
SFUN
- search function through linked list using binary search method
binarysearch
- Implementation of Binary search algorithm in C++.I hope this will be useful to all.The source code of this algorithm is in word (.doc) format.
Advance-Search-And-Replace(DELPHI)
- 对任意类型的文件中的内容进行字符串查找替换的高级工具软件源代码，用DELPHI编写。1.支持两种线程模式进行查找或替换：单线程、多线程 2.支持任意格式文件中查找，文件名支持通配符，可同时支持多种文件名 3.查找、替换内容支持使用二进制数据（16进制格式）或普通文本格式 4.支持替换备份，对不慎误替换的文件可以进行还原，防止误操作 5.使用内存搜索方式，速度很快 6.完全免费，提供完整源代码，没有任何功能限制 。-For any type of file contents s
Binary
- 一个简单的二分搜索算法测试程序 java版-A simple binary search algorithm java version of the test program
binary
- Binary search tree source code
折半查找法
- 折半查找法是效率较高的一种查找方法。假设有已经按照从小到大的顺序排列好的五个整数a0~a4，要查找的数是X，其基本思想是: 设查找数据的范围下限为l=1，上限为h=5，求中点m=(l+h)/2，用X与中点元素am比较，若X等于am，即找到，停止查找;否则，若X大于am，替换下限l=m+1，到下半段继续查找;若X小于am，换上限h=m-1，到上半段继续查找;如此重复前面的过程直到找到或者l>h为止。如果l>h，说明没有此数，打印找不到信息，程序结束。(The method of bin