▍1. shellpaixu
希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进(双语对照查看希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进。 Hill sorting (Shell Sort) is a kind of insertion sort. Is to improve the direct insertion sort algorithm. )
希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进(双语对照查看希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进。 Hill sorting (Shell Sort) is a kind of insertion sort. Is to improve the direct insertion sort algorithm. )
希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进(双语对照查看希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进。 Hill sorting (Shell Sort) is a kind of insertion sort. Is to improve the direct insertion sort algorithm. )
双链表的定义和插入算法,双链表的定义,删除,插入和查找算法(Doubly linked list of definitions and insertion algorithm, the definition of double-linked list, delete, insert, and search algorithm)
双链表的定义和插入算法,双链表的定义,删除,插入和查找算法(Doubly linked list of definitions and insertion algorithm, the definition of double-linked list, delete, insert, and search algorithm)
使用C语言完成党的霍夫曼编码,主要使用树的数据结构,作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)
使用C语言完成党的霍夫曼编码,主要使用树的数据结构,作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)
二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
说明: 进程死锁.资源分配图的绘制 建立所需数据结构; 使用题目21存成的资源分配图的文件作为输入; 编写资源分配图化简算法; 每化简一步,在屏幕上显示化简的当前结果; 最后给出结论,是否死锁,如思索给出死锁的进程及资源; (Process deadlock. Resource allocation mapping establish the required data structures Use title 21 deposit into resource allocation graph file as input writing resource allocation map simplification algorithm Each simplification step, on-screen display simplification of the current result Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
几个比较好的初级算法,初学者可以看一下思想,对算法入门(A few good elementary algorithms, beginners can look at thinking on algorithms entry)
数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)
以一个m*n的长方阵表示迷宫,0和1分别表示迷宫中的通路和障碍。设计一个程序,对任意设定的迷宫,求出一条从入口到出口的通路,或得出没有 通路的结论 (To an m* n the long square maze, 0 and 1, respectively maze of paths and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or the conclusions drawn without passage)
本实验设有一个线性表,分别实现数组结构存储的原地逆置。为数据结构课程必做实验。(This experiment has a linear form, respectively, to achieve the storage array structure in situ reverse home. For the data structure courses will do the experiment.)
数据结构快速排序例程代码,只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)
VC游戏编写中的求解最短路径算法源码,本示例是自动寻径演示,篮点是起点,红点是终点,按确定键开始。源码爱好者注:编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中,若不然会出错。 (The preparation of the VC games to solve the shortest path algorithm source code, in this example is the automatic routing demonstration, the basket is the starting point, the red dot is the end point, press the OK button to start. Source enthusiasts Note: When compiled and run, please copy the EXE file from the Debug directory to the root directory of the project, and if not be wrong.)
矩形件最优排样的程序,用Visual C编写,在6.0下能正常运行。(Rectangular pieces Optimal Nesting program)
本例主要设计查找的有关算法,例如有序表的查找和顺序标的查找,顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)
kd-树(k维搜索树)是把二叉搜索树推广到多维数据的一种主存数据结构。这里给出了其代码的VC++实现(Classic data structures- KD tree full implementation, with a detailed explanation of the code, the novice data structure good materials)
此程序用于解决8皇后问题,运行后输出8皇后问题的所有解(This program is used to solve the 8 queens problem, all solutions of 8 queens problem output operation.)
吴伟民版数据结构每个算法的c实现方法,并模块化处理,将各个功能分开编程,有助于移植使用(failed to translate)