在Visual C++访问Borland数据库引擎(BDE)，可实现对数据库的访问

系统功能简介 针对原考勤系统存在的缺点,新系统开发具有如下功能: 1.     支持CTR-2000II 和 ID-AS2000两种电脑考勤仪，且卡号为5位; 2.     工号最在长度为10位,实际使用长度可由用户自已决定; 3. 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

多线程进行二分排序法，递归产生新线程，每一个父线程产生两个子线程，接着父线程对两个子数组进行合并-Multi-thread two hours sorting method, recursive generate a new thread, each thread is a parent produces two sub-threads, then the parent thread to merge the two sub-arrays

实现学生基本信息、选课信息及成绩的增、删、改、查功能。-Achieving students to basic information, elective information, and performance increase, delete, change, check functional.

《数据结构与算法》讲义，第4章 字符串。 “十一五”国家级规划教材。张铭，王腾蛟，赵海燕，《数据结构与算法》，高教社，2008. 6。-Chap4 Sting

前k条最短路径（KSP）算法在国内鲜有研究，本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。 其中以Martin先生的删除（Delelte）算法与Yen先生的背离（Devation）算法为主。 其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。 算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in

英文版Access数据库编程-English Access Database Programming

我们在学习外省市先进经验的基础上，结合教材管理工作实际情况和多年的工作经验，组织了专门人员与协力电脑公司利用Vb6.0程序语言和SQL数据库语言共同开发研制了“河北广播电-we learn advanced experience of other provinces and cities on the basis of materials management with the actual situation, and many years of work experience, organized with the help of specialized personnel computer companies use Vb6.0 programming language and SQL database language jointly developed "Hebei Radio

由于简单模式匹配算法在一次字符比较失败后，简单的把模式串位置向前移动一个字符位置，这样就丢掉了前面字符匹配中得到的信息，效率差。所以就需要一种无回溯的算法来提高效率，这里使用KMP（Knuth-Morris-Pratt）算法。模式串前面的连续片断部分称“前缀模式”，前缀模式在模式串后部重复出现的情况可以用来避免重复进行已经做过的检查，这是KMP算法中的一个重要概念。-as simple pattern-matching algorithm to compare a character failure, a simple model put forward position Series mobile location of a character, would be lost in front of characters matching the information inefficiently. There is a need for a non-backtracking algorithms to improve efficiency, the use of KMP here (Knuth-Morris-Pratt) algorithm. Model Series in front of a row clips part said "prefix model," prefix string pattern in the pattern of recurring back can be used to avoid duplication of inspection has been done, KMP algorithm is an important concept.

基本的冒泡算法，可供数据结构的初学者参考，希望能有所帮助。-sort

采用链式存储结构设计广义表,实现以下操作:创建广义表,取广义表的表头元素和表尾元素 求广义表的深度-Chain store use of the structural design of the generalized form, realize the following: create a generalized form, check the generalized table header elements and table elements for the end of the depth of the generalized form