▍1. string.tar
数据结构课程设计--实现并对比三种基本的字符串匹配算法(EasyMatch Rabin—Karp KMP)
数据结构课程设计--实现并对比三种基本的字符串匹配算法(EasyMatch Rabin—Karp KMP)
c++数据结构中的二分查找树,是比较基本的数据查找结构,查找效率比较高(c++ data structure in the binary search tree, is a more basic data to find the structure to find more efficient)
这是一个二叉树左右子树交换的简单程序,希望对大家有用!(This is a binary tree so the simple sub-tree exchange procedures in the hope for all of us!)
最小生成树算法 克鲁斯法尔算法 球最佳路径(kulru method class maiun void cx )
八皇后问题,用vc编写了一个可以解决八皇后问题的程序,实现了递归调用。(The eight queens problem, using vc write a means of solving the eight queens problem program to achieve the recursive calls.)
用VC++编写中值滤波的算法,具有图形界面(The algorithm of Filter ,which use VC++)
使用VC编写的约瑟夫环程序,简单明了,方便使用(Prepared using the VC Joseph Central program, simple and clear, easy to use)
说明: nuaa1108 多少连续的1 解题报告(Problem solving report )
说明: ACM及各类基本算法模板,包括数据结构,计算几何,字符串,图论,数学,高精度等许多常用模板(ACM basic algorithm and various templates, including data structures, computational geometry, string, graph theory, mathematics, high-precision, and many other commonly used templates)
说明: 高速多字符串匹配程序,基于多字符串的KMP算法开发,能够实现多字符串的匹配(High-speed multi-string matching procedure, based on multi-string KMP algorithm development, to achieve multi-string match)
Hanoi塔问题非递归算法实现,几个具体的实现算法(Tower of Hanoi non-recursive algorithm, the realization of a number of specific algorithms)
数据结构课程作业,查找算法。用哈希算法下实行查找(Data structure course work, search algorithm. Under the hash algorithm used to find)
数据结构与程序设计中的重点例子程序:八皇后问题(Data structure and procedures of the focus of the design example of the procedure: eight queen problem)
克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针,a2是最小生成树边集的头指针,k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数. (In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers.)
排序程序,包含快速排序、归并排序、谢尔排序、插入排序。输出了比较次数和移动次数。(It is a sort program, including quick sort, merge sort, shell sort and insert sort.It outputs the compare times and movement times.)
数据结构课程设计 数据结构B+树 B+ tree Library(B+ tree Library)
一个关于二叉树应用的小程序,包括二叉树的建立,前中后遍历等操作(a program about bintree structure)
本程序是用c语言编写的在800位整数之间的乘积运算(This procedure is written in c the 800 integers in the product operation between)