搜索资源列表
binSearch
- 基于利用qt creator开发的二分查找源码，代码详尽！-The qt creator development based on the use of binary search source code detailed!
binary
- 使用PHP代码实现的二分查找算法，已经封装成方法，并有一个使用示例-Binary search algorithm implemented using PHP code has been encapsulated into methods, and there is a usage example
Student-Management
- 一个学生管理系统，可进行学生的添加，删除，查找，排序；学生信息的修改和打印；排序有插入、选择、希尔、归并、快速排序方法；查找为二分查找的各个版本。内附报告-A student management system, students add, delete, search, sort students modify and print information sort with insert, select, Hill, merge, quicksort Find for the vario
data
- 数据结构课程练习代码，包括单链表，二叉树，哈夫曼树，顺序查找，二分查找，图的遍历-Data Structure Course practice code, including single linked list, binary tree, the Huffman tree, sequential search, binary search, graph traversal
erfenchazhao
- 二分查找程序 vc环境下运行 算法程序 欢迎大家下载-Binary search program the vc environment running algorithm welcome to download
binary-search
- 严蔚敏《数据结构》中有序顺序表的二分查找算法实现-Yan Wei-min data structure in the ordered sequence table binary search algorithm
intoduction_to_algorithms
- 算法导论第二章各种排序算法的实现,包括插入排序，选择排序，归并排序，冒泡排序，二分查找等。-Introduction to Algorithms,Chapter 2.
binary_search
- 二分查找小程序，将输入的数字与已经排好顺序的数组进行二分查找，得到其所在位置-Two hours to find a small program that will input the numbers and have an array of good order binary search, get its location! !
binarysearch
- 实现二分查找，结合了排序功能，先进行排序，然后二分查找-the function to fulfill the binarysearch and sort the arrray
binarySearch
- 二分查找，最简洁的编程实现，binary search-Binary search, the most concise programming, binary search
bfind
- 实现数组的二分查找，C++，用到的是递归方式-Implement an array of binary search
binarysearch
- 二分查找问题要求对任意输入的一个数字在一个数组中进行查找，若不在数组中就返回“输入的数字不在数组中”，若在数组中就返回“输入的数字是数组中第 d个数字”。-Binary search problem calls for arbitrary input a number in an array to find, if not in the array will return " number entered is not in the array" , if the array i
2_3_7
- 归并排序，对一组数据进行归并排序，并实现对这组数据的二分查找-Merge sort
search
- 本程序实现了 各种查找算法，主要是几个版本的二分查找和顺序查找，并给出接口进行各种算法的比较。-This program implements a variety of search algorithms, mainly several versions of binary search and sequential search, and gives a comparison of various algorithms interface.
zuoye5
- 二分检索（分治法）给定递增整数序列L，其大小为n，要求使用二分查找法查找任意元素的位置k(序列中第几个)。-Binary search (divide and conquer) given increasing sequence of integers L, and its size is n, and requires the use of binary search method to find the location of any element k (sequence of sever
Bucket-sort-binary-search
- 随机产生一定范围内的数然后进行桶排序，最后二分查找这些数中的一些数。-Generating a random number within a certain range and then the bucket sort, the last two of these numbers to find the couple.
binarySearch
- VC++6.0实现的二分查找，能实现对特定数字的查询并输出所在位置。-VC++6.0 achieve binary search, to achieve a specific number of query and output location.
sort_and_search
- 几个重要的排序算法（插入，冒泡，选择及快排等）和查找算法（普通查找，二分查找）-Several important sorting algorithms (insertion, bubble, selection and fast scheduling, etc.) and search algorithms (general search, binary search)
lab1
- Objective C实现的简单的二分查找，查找前快速排序。-Objective C to achieve a simple binary search, find quick sort before.
Search
- 二分查找的实现 输入一个数组，程序将对其进行排序，并打印出排序结果 再输入一个数，程序会查找这个数在已排序数组中的位序，并打印出来-Find the realization of two Enter an array, the program will be sorted, sort and print out the results Then enter a number, the program will find this number in the sorted ar