搜索资源列表
成绩输出
- 知道成绩表，按分块查找法查找学号为几的各科成绩，索引表分3块。-know its performance, by the sub-block search, law school to find several branches achievements, indexing table three points.
SimpleDataStruct
- 小弟初学者，简单数据结构： 包括单链表逆置，对陈矩阵相乘，分解单链表，分块查找，交换左右自述，模式匹配，二叉排序树、删除子串，冒泡排序等-younger beginners, a simple data structure : single-chain including inverse home, Chen matrix multiplication, single-chain decomposition. Search Block, exchange around the readme,
jasmine9
- 哈希表查找、分块查找 1. 编写一个程序,输出在顺序表{8,14,6,9,10,22,34,18,19,31,40,38,54,66,46,71,78,68,80,85,100,94,88,96,87}中采用分块查找方法(每块的块长为5,共有5块)查找关键字46的过程. 2. 编写一个程序实现哈希表的相关运算, 并在此基础上完成如下功能: (1) 建立{16,74,60,43,54,90,46,31,29,88,77}哈希表A[0…12], 哈希函数为: H(k)=key ％ 13,
MUZI3
- 随机产生5组测试数据，分别进行顺序查找，折半查找和分块查找，输出比较结果-five groups randomly generated test data, for the order to search, locate and half-block search, the output results
search
- 索引顺序表查找,索引顺序查找即分块查找，是将顺序表分成诺干块。-Indexed sequential table lookup, the index in order to find that the search block is to the order of the table is divided into Nokan blocks.
blksearch
- 该程序 可以用于实现数据结构中的分块查找-this can be used to select the data you need
yanshi
- 数据结构基本操作 冒泡排序、堆排序、归并排序、快速排序、分块查找、二分查找演示-Basic operation data structure bubble sort, heap sort, merge sort, quick sort, sub-block search, binary search demo
dataorganization
- 数据结构的常用方法该视屏中包含：B树的删除，B树的生长过程，堆的排序，分块查找，直接插入排序，希尔排序，快速排序-Commonly used method of data structures contained in the screen: B-tree delete, B-tree growth process, heap sort, sub-block to find a direct insertion sort, Hill sort, quick sort, etc.
haxibiao
- 附有实验报告。。1、查找的基本概念和查找的几种方法以及求查找的平均查找长度。 2、静态查找表（基于线性表的查找法）。顺序查找、二分查找和分块查找。 3、动态查找表（基于树的查找法）。二叉排序树、二叉平衡树、 B_ 树和B+ 树。 -1, find the basic concepts and find several methods, as well as seeking to find the average search length. 2, static lookup tabl
Blocksearch
- 用C语言实现分块查找 用C语言实现分块查找 -With the C language implementation block to find With the C language implementation block to find
chazhaobaogao
- 数据结构遍历树的实验，有源码，可以任意输入1组有序数据；对顺序查找、折半查找、分块查找的查找次数进行比较并输出比较结果。 -Traverse the tree data structure to the experiment and source code, you can import a group of arbitrarily ordered data on sequential search, binary search, block search to find the numb
chazhao
- 基于索引顺序表的分块查找,用于关键字查找-Based on the index block to find the order form for keyword search
45
- 程序功能包括：主程序；顺序查找、二分查找和分块查找的实现；过程追踪以及结果输出等；-Program features include: the main program sequential search, binary search and find the realization of block process tracing, and outputting the results
fastsort
- 这个程序能够很好的实现数组的分块查找功能，简单，易懂-This program can achieve the array block search function, simple, understandable
search_in_part
- 这个程序的功能是能够实现分块查找，优化查找算法，加快查找时间-This program is the ability to realize block search, optimization search algorithm, to speed up search time
fenkuaichazhao
- 试编写利用折半查找确定记录所在块的分块查找算法。 提示：1. 读入各记录建立主表； 2. 按L个记录/块建立索引表； 3. 对给定关键字k进行查找； 测试实例：设主表关键字序列：{12 22 13 8 28 33 38 42 87 76 50 63 99 101 97 96}，L=4 ，依次查找K=13， K=86，K=88 -Trial preparation records using binary search to determine where the bl
block
- 利用折半查找确定记录所在块的分块查找算法. 读入各记录建立主表,按L个记录/块建立索引表, 对给定关键字k进行查找-Use binary search to determine where the block record block search algorithm. Read into the record to establish the main menu, press L record/block index table, k for a given keyword searc
find
- 利用分块查找算法在线性表（学生情况表）list中查找给定值key（学号）的结点-Block search algorithm using the linear table (table of students) list in the search for a given value of key (Student ID) of the node
Sequential-search
- 本程序仅仅是模拟分块查找算法中的顺序查找,比普通的顺序查找快, 但并不是最快的查找算法, 如果你要更快的算法,可以将备查询的元素从小到大排序好,再用二分查找即可. -This procedure is only analog block search algorithm in order to find, faster than the normal order to find, but not the fastest search algorithm, if you want a
shunxuchazhao
- 本程序仅仅是模拟分块查找算法中的顺序查找,比普通的顺序查找快, 但并不是最快的查找算法, 如果你要更快的算法,可以将备查询的元素从小到大排序好,再用二分查找即可.-This procedure is only analog block search algorithm in order to find, faster than the normal order to find, but not the fastest search algorithm, if you want a faster