资源列表
Soaring
- 本程序是在c调试成功的．对初学者有很大的作用！-the procedure was successful c debugging. For beginners a significant role!
单链表操作算法
- 单链表的一些简单算法。-some simple algorithm.
高斯消元法解线性方组选主元
- 高斯列主元消元法， 这只是我个人的一种解法，仅供参考。-out PCA Gaussian Elimination Act, this is my personal one solution for reference.
suanf a
- c常用算法，用语言编写，为本人数据结构与算法设计作品，在VC++环境下编译通过-c commonly used algorithm, the language used to prepare for my data structure and algorithm design works in the VC environment compile
MFCerfen
- 用二分法解高阶方程的近似解。区间范围合计算精度可调，每一步的计算结果一列表的形式显示出来，一目了然-dichotomy solution with the higher-order equation approximate solution. The scope of a range accuracy adjustable every step of the calculation results in the form of a list show up clearly
fftdll
- 快速傅立叶变换FFT的动态链接库DLL，适合个种语言，VB，VC，delphi-FFT fast Fourier transform of the DLL, suitable species language, VB, VC, Delphi, etc.
FixMath
- 这是我本人编写的一个32位定点小数运算的函数库。对于没有浮点运算器的场合，可以提供进行小数运算的一种途径-This is my prepared in a 32-bit fixed point decimal computing functions. For no floating point unit occasions, it can provide for fractional arithmetic, as a way to
大夫
- 书籍管理系统，SQL数据库课程设计，用C实现与SQL数据库连接实现书籍增加删除查询等功能模块，采用分模块法，论文与代码齐全，-book management system, SQL database curriculum design, realization of C and SQL database connectivity to achieve books increased inquiries delete function module, a sub-module, papers an
ZUIXINDI
- 最接近点对问题，分治法实现，随机生成N个数寻找最短路径的两个点-closest point of the problem, realizing the partition method, random number generation N to find the shortest path to the two points
软件工程设计最终完成
- 人事管理系统，软件工程课程设计，TC3下调试成功，采用链表结构，实现增加删除查询等功能，调用汉字库实现汉字输出-Personnel Management System, software engineering curriculum design, debug TC3 successfully used Chain structure, the added features such as deleted inquiries, call for Chinese exports Store
书店管理
- 书店管理程序，TC3下调试成功，可以实现书籍增加，删除，查询等功能，数据采用文本保存-Bookstore management procedures, debug TC3 success can be achieved books to add, delete, query capabilities, data using text preservation
蕊
- 学校景点分布图最佳路径选择，通过最短路径选择让游者能够自由选择最佳观赏路径-schools attractions distribution choose the best path through the shortest path chosen You can watch free to choose the best path