这是一个学生数据库管理的小程序，本人乃学生，刚学习数据库编程，做了个这个，献丑了...

libaly for orcad 16.2

分治的思想 归并排序 分治是很重要的方法 归并排序是一种快速的排序-Divided ideological merge sort is very important sub-rule method is a quick sort merge sort

用C++实现的快速傅立叶变换（FFT）的结构算法，其功用就不用细说了吧-C realized Fast Fourier Transform (FFT) algorithm structure, its purpose would not have to elaborate on it

杭州电子科技大学ACM-OJ系统的部分代码，对学习数据结构还有算法很有帮助-Hangzhou University of Electronic Science and Technology ACM-OJ part of the system code, data structure of the learning algorithm was also very helpful

纯C语言写的小型通用数据库，一个C数据结构组科技小组的作品，附有开发思路PPT，这可是一个宝贵的资源哦，更底层的东西，运行于DOS提示符，可以新建数据库等操作。C的编程高手们值得参考一下。-Pure C language to write a small general-purpose database, a data structure C Group Technology Group works to develop ideas with PPT, this is a valuable resource Oh, and the bottom of things, running on the DOS prompt, you can operate a new database. C programming masters worthy of reference.

遵循C和基本C++标准的Map类，移植来至MFC的MapPtrToPtr，可以在各种平台下使用，可以在各种编译器下编译。-Follow the C and basic C++ Standard Map class, transplanted to the MFC

ODBC源代码:odbc_classgen-odbc code :odbc_classgen

一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution

本程序为本人本科期间一次课程设计，粗制滥造，本不敢拿出示人，无奈急需源码一份，苦于无积分在身，只得滥竽充数。各位若是刚刚入门的新手，就不必看了，以免被我误导。技术问题    这里只有数据库设计部分以及部分SQL语句。