▍1. Circlist_Josephus3_4
循环链表的应用 循环链表的应用 很方便的实现(cycle Chain cyclic chain of convenience Implementation)
循环链表的应用 循环链表的应用 很方便的实现(cycle Chain cyclic chain of convenience Implementation)
/* shiyan.c 第四组数据结构实验作业。Author:zhg 功能:本程序用于验证函数 LocateElem(L,e,compare()) 。即求出现行表中元素的位序。 程序中的线性表采用顺序存储,以更方便于该操作的实现。 */ (/* shiyan.c fourth group structure of the experimental data. Author : zhg function : This procedure is used to validate function LocateElem (L, e, compare ()). Calculated that the existing table spaces sequence elements. Procedures using the linear sequence of storage, in a more convenient to the realization of the operation.* /)
一元多项式加减程序 C 这是基在C下的数据结构算法(one yuan polynomial modified C-This is the C-based data structure algorithm)
Devil language 数据结构中的经典问题 此为问题!(Devil language data structure of the classic problems of this problem!)
代码注重B树插入、删除的算法逻辑,适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作(focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation )
BF和KMP算法实例,曾经的作业,希望对你有点帮助(BF and KMP algorithm example, once the operation, and I hope to you a little help)
设有1000个值在1到10000的整数,试设计一个利用散列方法的算法,以最少的数据比较次数和移动次数对它们进行排序。(with 1,000 in value from 1 to 10,000 integer and try to design a method of using hash algorithm, the minimum number of data comparison and the mobile number of their rank.)
马踏棋盘的贪心算法,8*8棋盘,基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)
这个代码是STRING类的声明及实现,因为我认为C++类库中的string类比较庞大,找一个函数需要很长时间,所以用一个简单明了的代替之.(STRING kind of statement and realized, because I think the C library string of relatively large, a function for a very long time. Therefore, the use of a simple and straightforward replaced it.)
说明: 贪心方法是一种改进了的分级处理方法。它首先根据题意,选取一种量度标准。然后按这种量度标准对这n个输入排序,并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解,则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)
说明: 马踏棋盘算法编程,实现在棋盘上任意两点间的最短路径求解。(horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.)
说明: 经典C程序100例,对于初学者非常值得研究.内有各种排序,找素数问题,字符串处理等.(classic C program hundred cases for beginners is worth studying. There are various sort, finding prime numbers. string processing.)
说明: 数据结构作业代码。 最小生成树 Prim实现。 win32 Console界面。(operation code data structure. Prim achieve the minimum spanning tree. Win32 Console interface.)
说明: 离散随机线性系统的卡尔曼滤波。 其中13lman.c是卡尔曼滤波函数,4rinv.c是滤波函数中用到的矩阵求逆函数,13lman0.c是主程序。(discrete stochastic linear Kalman filtering system. 13lman.c which is the Kalman filter function, 4rinv.c filtering function is used in the matrix inversion function, is the main program 13lman0.c.)
COM中使用SAFEARRAY数组例程,代码中给了两种数组的用法,一种是字符串数组,另一种是自定义数据结构数组。 (use COM SAFEARRAY array routines, a code for the use of two arrays, a string array, and the other is from the definition of array data structure.)
约瑟夫环的循环链表实现,这个程序比较完整,有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)
同济大学课程设计中的一道题! 要求能够输入树的各个结点,并能够输出用不同方法遍历的遍历序列;分别建立建立二叉树存储结构的的输入函数、输出层序遍历序列的函数、输出先序遍历序列的函数.(Tongji University in curriculum design, the one that! Tree request to enter the various nodes, and can output using different methods traverse the traversal sequence; Binary Tree set up to establish the structure of the storage function input and output sequence traversal sequence of function, the output preorder sequence of function.)
数据结构算法集锦:包括大量常用算法,如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法(algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.)
数据结构各种经典排序法集锦,包含了几种最常用的排序法(various data structure classic sort magazines, including several ranking of the most commonly used method)