Produced by a simple VB

这是我们实习时编的，实现了基本的功能，如插入，删除，查找等。初学 C++的同志们可以参考：）-This is our attachments series to achieve the basic functions, such as inserting, deleting, and searching. Novice C comrades can reference :)

本系统为餐饮管理系统，为现代餐饮业管理更便捷化，节约时间-This system is catering management system for modern catering industry oriented management more convenient, saving time

ministack类的实现，数据结构的作业，模拟出类似stack类的ministack，已经通过测试-ministack class implementation, data structure operations to simulate a similar stack class ministack, has passed the test! !

本程序是一个用于管理学生成绩例子．通过利用MFC的DAO类，用VC++编写独立与DBMS的应用程序-this is a procedure for the management of the performance of their students examples. Through the use of the MFC DAO category, prepared by VC independence and DBMS applications

各种数据库语法，如 Oracle、DB2、Informix、MySql、Postgre-Syntax of various databases such as Oracle, DB2, Informix, MySql, Postgre

使用VC++对Excel的数据读取，使用VC++6.0编写，含有《odbcinst.h》头文件编写,如果还有疑问请发邮件给我-use Excel to read the data, the use of VC 6.0, containing "odbcinst.h" The first document preparation, if still in doubt please send an email to

数据结构中线性表的合并链式实现，VC++实现的。-Data structure in linear chain realize the merger table, VC++ Achievable.

使用两个向量的叉积来判断两条线段是否相交-The use of the cross product of two vectors to determine whether two line segments intersect

这个程序是按照离散数学教材上给出的算法写的，是字典序的全排列算法。空间复杂度是O(n)，时间复杂度基本上是O(n^2)。缺点是只用于打印并没有储存所有的结果。-the procedure is in accordance with the materials on discrete mathematics algorithm is written, is a wholly-lexicographic order algorithm. Space complexity is O (n), is basically time complexity is O (n ^ 2). Only drawback is not for print, and store all the results.

组合问题，从M个不同字符中任取N个字符的所有组合-Combination of issues, from the M different characters of any N-character check all combinations