搜索资源列表
查找.cpp
- 用冒泡、折半、插入、选择四种分类方法查找所需的元素-with bubbling half, insert, select four classifications identify the necessary elements
zhebanchazhao
- 一种基于VC的折半查找方法源代码,对VC初学者有用-a VC-based binary search method source code, useful for beginners VC
电话本管理系统
- 该系统是本人课程设计作业,因为时间关系,只用了两天多的时间编成。所以有很多地方没有得到增强。版本为1.0。现作以下升级。 增加NEW,OPEN版本。 提高输入容错。判断输入的对错。 时间关系,搜索功能为线性搜索,现增强如下:f_search:费氏查找法;btree:二叉树查找法;l_search:线性查找法; r_search:递归折半查找法;zcsear:杂凑碰撞查找法;o_sear:插补查找加强法; 排序是冒泡法,现增强为:heaps:累堆排序;binary:二叉树排序;xieer:谢耳排序
zhebanchazhao
- 关于对顺序链表的折半查找功能的实现等等,非常有用
电话本管理系统
- 提高输入容错。判断输入的对错。 时间关系,搜索功能为线性搜索,现增强如下:f_search:费氏查找法;btree:二叉树查找法;l_search:线性查找法; r_search:递归折半查找法;zcsear:杂凑碰撞查找法;o_sear:插补查找加强法; 排序是冒泡法,现增强为:heaps:累堆排序;binary:二叉树排序;xieer:谢耳排序;sinsert:插入排序;quicks:快速排序;select:选择排序法;-increase input fault tolerance. Imp
order.rar
- 有15个数按由小到大顺序放在一个数组中,输入一个数,要求用折半查找法找出该数是数组中的第几个元素的值,如果该数不在数组中,则打印出无此数,There is 15 the number of small to large order placed by an array, enter a few, require half the number of search method to find the array are the first elements of some value, if t
FindHalf
- 用汇编对个数确定的数组进行折半查找,并显示最后结果-With the compilation of the number determined to carry out half the array to find, and display the final results
chazhao
- 这是一个数据结构中的折半查找的的代码,可以实现查找的功能-This is a data structure to find the half of the code, find the function can be achieved
123
- 武汉理工汇编实验报告!顺序结构 气泡浮起 折半查找 这半查找优化-A compilation of the experimental report
masm59
- 附加段中有个一已经排序的数组,数组中第一个元素存放数组的长度,在AX中有个无符号数,在数组中查找(AX),如果找到,则CF=0,,在SI中存放该元素在数组中的偏移地址。使用折半查找的方法-Additional paragraph, there is an already sorted array, the first element in the array store the length of the array have a unsigned number in AX, (AX) in t
caibanchazhao
- 生成递归数列1~n 折半查找,输出k的值-Generate a recursive series 1 ~ n binary search, the output of k values
1214
- 编写一个完整的折半查找程序 构造待查找列表时先输入长度再从小到大输入该列表的元素-The preparation of a complete binary search procedure.Constructing a lookup list to enter the length from small to large to enter the list of elements
leaf
- 用汇编语言实现折半查找算法的运作,是大学汇编语言设计课程的内容,有需要的下载吧-The operation of the binary search algorithm implemented in assembly language, is the the University assembly language design course content, there is a need to download
binsearch
- 折半查找,数据结构的教程书籍《数据结构算法实现及解析》高一凡,中的实例,实现查找方法中的折半查找。-Binary search, the tutorial books " of the data structure data structure algorithms and parse" high Yifan, in the instance to achieve binary search in the Find method.
code
- 数据结构折半查找算法代码,便于更加深刻的理解算法-Data structure binary search algorithm code, to facilitate a deeper understanding of algorithms
chazhao-
- c语言写的数据结构查找算法,包括顺序查找,折半查找和分块查找-c language data structure lookup algorithms, including sequential search, binary search, block search.
find
- 有n个整数(1<=n<=100)按由小到大顺序存放在一个数组中,输入一个数m,要求用折半查找法找出该数是数组中第几个元素的值。如果该数不在数组中,则输出“Not found.” -There are n integers (1 <= n <= 100) by ascending sequence stored in an array, enter a number m, asked to use a binary search method to find the
chazhao
- 1、实现折半查找算法 2、实现二叉排序树的建立、查找和删除 -1, to achieve the bisearch algorithm 2, the establishment of two fork sort tree, find and delete
59
- 在附加段中有个一已经排序的数组,数组中第一个元素存放数组的长度,在AX中有个无符号数,要求在数组中查找(AX),如果找到,则CF=0,在SI中存放该元素在数组中的偏移地址。本例使用折半查找的方法(In the appended segment, there is an array that has been sorted. The first element in the array holds the length of the array. There is an unsigned numb
折半查找法
- 折半查找法是效率较高的一种查找方法。假设有已经按照从小到大的顺序排列好的五个整数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