货郎担限界算法 c语言

这个是数据结构经典实现算法，是一些很不错的算法-shu ju jie gou jing dian suan fa shi xian

用VFP编的电脑查询系统,比较简单,适合初学者参考.-with VFP addendum to the computer search system, a relatively simple reference for beginners.

数据结构常用算法程序集1，描述数据结构算法。-data structure used an algorithm set procedures described algorithm data structure.

可以进行简单的S型座位编排！这是一个数据库应用的小程序，可以继续扩展其功能-can conduct a simple S-type seating arrangements! This is a small database application procedures, can continue to expand its functions

队列相关的所有基本算法，西电的老师写的，与吴伟民数据结构课本完全一致，用C实现-cohort of all the basic algorithm, the West-- written by the teachers, and textbooks Xiulan WU Weimin data structure is fully consistent with achieving C

SQLite中如何用API操作BLOB类型的字段-how to use SQLite API type BLOB fields

3X3填质数问题，在一个3×3的矩阵中填写1－10的数字，保证上下左右相加都是质数-3X3 fill several quality problems in a 3 3 matrix to fill in the figures 1-10, ensuring that all about is the sum of the number of quality

本书是作者编程经验的结晶，由发表在杂志上的专栏文章构成，每一章内容相对独立，但都是编程过程中的有机组成部分。本书内容包括问题定义、算法、数据结构、程序验证与测试、程序优化与效率问题，以及这些技巧在排序、查找和字符串处理等方面的几个实际应用。本书每章末尾都附带有相关内容的问题，附录中给出了一些问题的提示和解答。仔细思考问题或与同事进行讨论，可以巩固所学知识，将作者的经验应用到自己的编程实践中。-This book is the author of the crystallization of programming experience, published in the journal by the column consists of the contents of each chapter is relatively independent, but they are in the process of programming an integral part. The book includes problem definition, algorithms, data structures, program verification and testing, process optimization and efficiency issues, as well as these skills in sorting, string search and deal with several aspects of practical application. The book comes at the end of each chapter has relevant content issues, the appendix gives some tips and answers to the problem. Think carefully about questions or discussion with colleagues, you can consolidate the knowledge acquired will be applied to the author

结构分析程序2，用fortran90编写，主要用于结构分析-two structural analysis procedures used to prepare FORTRAN90, mainly for structural analysis

数据结构常用算法之一-Dijkstra算法,实现最短路径选择.-algorithm commonly used data structures one-Dijkstra algorithm to achieve the shortest path to choose.