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

本程序是在c调试成功的．对初学者有很大的作用！-the procedure was successful c debugging. For beginners a significant role!

数据结构用java实现的一些源代码，包含了我们常用的一些数据结构。-java data structure used to achieve some of the source code, including our common data structure.

A*算法，自己通过学习写的，希望大家多多指点.....mqfcu7@tom.com-A* algorithm, by learning to write their own, and I hope a lot of pointing everyone ..... mqfcu7@tom.com

AppWizard has created this 插队买票1 application for you.   This file contains a summary of what you will find in each of the files that make up your 插队买票1 application. 插队买票1.dsp     This file (the project file) contains information at the project level and     is used to build a single project or subproject. Other users can share the     project (.dsp) file, but they should export the makefiles locally. 插队买票1.cpp

严蔚敏编写的《数据结构》第9章的答案，全部为源码-the answers of chapter 9 of a book called ‘Data Structures’ writen by Yan Wei Min

一个操作Sql Server 2000数据库的工具,支持远程（局域网）操作 主要功能就是远程（局域网）操作Sql Server数据库 包括： 搜索并列举局域网内的所有Sql Server服务器 搜索并列举Sql Server服务器中的所有数据库 搜索并列举数据库中的所有表 对数据库结构的简单更改 对数据库表记录的查找、编辑等等。

SR-tree is an index structure for high-dimensional nearest neighbor queries，C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image / video applications.-SR-tree is an index structure for high-dimensional nearest neighbor queries,C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image/video applications.

一些常用的几何算法的C++实现,包括两点确定一条直线,两点间距离,点直线距离, 海伦公式求三角形面积,判断直线相交等-some common geometric algorithm C achieved, including two identified a straight line, the distance between two points, point straight distance Helen formula for triangle area, as judged straight intersection

该程序完成对二叉树的非递归中序遍历，因为其中涉及到二叉树的构造，而且使用类来构造，所以代码比较多。-completion of the process of non- recursive binary tree which preorder because it involved the construction of a binary tree, but the use of class structure, the code more.

应用背景毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级毕业设级关键技术好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的好的的