这是计算机专业硕士生课程《算法设计与实现》中讲到的模式匹配算法的实现，并且将该算法与KMP算法进行了比较。...

分类器是对每一个输入模式赋予一个类别名称的软件或硬件装置，而贝叶斯分类器是各种分类器中分类错误概率最小或者在预先给定代价的情况下平均风险最小的分类器。它的设计方法是一种最基本的统计分类方法

包罗各种算法，相当全面，可以下载看看，具体有单元加、求进制、汉诺塔、底层编程、小写数字转为大写数字、数据结构、算法基础等等。-Cover a variety of algorithms, is very comprehensive and can be downloaded to see the specific unit plus, and band, Tower of Hanoi, the underlying programming, lower case to upper case the number of figures, data structures, algorithms, etc. basis.

数据结构课程设计！MFC做的！ 其中有个是链表（单链表，双向 链表图形化演示），另一个是 图的最小生成树的图形化演示）。-data structure course design! MFC done! Which is a linked list (single linked list, and two-way linked list graphic demonstration), Another is the minimum spanning tree graphic demonstration).

MfcCDDB v1.11 A freeware MFC class to support access to CDDB servers Welcome to MfcCDDB, a collection of freeware MFC classes to support access to the Compact Disc DataBases on the Internet .

一个访问数据库的学生管理系统，在后台实现sql查询，详细程序看语句。文本

应用背景关键技术

编程实现出圈问题。是上《数据结构》时候的一次实习的成果。-Programming problem to achieve a circle. It s a program produced during learning data structure

数据结构 严蔚敏 用到的实验代码 迷宫探险，多多分享了啊-YAN Wei-min data structure used in the experiment code maze adventure, shared a lot of ah

很适合初学者《数据结构实验与实训教程》（PDG）.zip- Suits the beginner very much "Construction of data Experiment And Really Teaches Course" (PDG) zip

最小生成树，使用PRIM方法生成最小生成树。-Minimum Spanning Tree, use the PRIM method to generate minimum spanning tree.