数据结构中各种排序算法，数据结构中各种排序算法

我们的作业题，队列和栈函数，对理解这两个概念有帮助-Our operating title, queue and stack functions, understanding these two concepts help

该系统为订单系统，用于管理订单信息-orders for the system, information for the management of orders

2.1将n个人围成一圈，m为未进入游戏前的先行码，用来淘汰第一个出 局的人，然后依次给出淘汰者的密码，根据输入的密码来确定下一个淘汰是哪一个，并依次输出被淘汰的人对应的号码。 2.2用单向循环链表实现操作。-2.1 n personal cordons m not yet entered the game before the first yards out for the first out, then eliminated were given the password, the password to determine under which a one-out, and turn out the output of the corresponding number. 2.2 List circle with a one-way operation to achieve.

本代码是约瑟夫环的循环链表实现方法,可以帮助理解约瑟夫环的基本原理,及其实现-This code is Joseph Central List realize the cycle method, can help to understand the basic principles of Joseph Ring, and its realization

仓库管理系统简单版-warehouse management system simpler version

数据结构，牛顿插值法。通过牛顿插值法求解方程-Data structure, Newton interpolation. Solving equations using the Newton interpolation

本程序用分支界限方法解决ＴＳＰ问题，即旅行商问题．-the procedures used branch line solution to TSP, the traveling salesman problem.

此篇代码的功能是关于K路文件的归并，用于数据结构，算法等设计-Cipian functionality of the code files on K road merging, for data structures, algorithm design

无向图的最小生成树程序，还不错哦~供大家分享，有文字说明-Undirected graph of the minimum spanning tree procedure, but also good for your sharing ~ Oh, there are text

子集和问题.rar:这是我学算法设计时的总结,包括定长和不定长做法(也就是回朔法,剪枝限界),当然也包括穷举法.-subset and problems. Rar : This is my learning algorithm design at the conclusion, including fixed-length and variable length approach (that is, back to Schomburg, pruning Bound), which of course includes exhaustive law.