货郎担限界算法 c语言

算法艺术与信息学竞赛.pdf,仅供大家参考。-Algorithm art and informatics competitions. Pdf, for your reference.

这个程序是按照离散数学教材上给出的算法写的，是字典序的全排列算法。空间复杂度是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.

设有n个人站成一圈，每个人持有一个密码（正整数)。现从第t个人开始，按顺时针方向“1,2,3,4,…”循环报数，数到m1（第t个人所持密码）的人出列，然后从出列者的下一个人重新开始报数，数到m2（刚出列者所持密码）的人又出列，如此重复进行，直到n个人都出列为止。-something like Joseph problem

SQL入门使用与高级使用篇。 SQL入门使用与高级使用篇。-SQL entry with the use of the use of the High chapter. SQL entry with the use of the use of the High chapter.

很好的教程实例，教务管理系统，Access数据库实现~-Very good tutorial examples of educational management system, Access database, to achieve ~

八数码问题的C++实现，最经典的广度有限算法-eight digital realization of the C and classic algorithms limited breadth

这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm

航空售票系统- Aviation booking system

数据结构：轮渡管理-data structure : the ferry management

对于小型图书销售书店而言此软件具有图书销售管理功能，可大大减轻Boss的工作量及帐目清算工作。也对这方面软件开发者有参考价值。-book sales for small bookstores run the software with book sales management functions. Boss can greatly reduce the workload and accounts for liquidation. Also in this area software developers have reference value.