数据结构的课后练习

我写的数据结构小程序是关于排序算法的，功能比较全-I write the data structure of small programs algorithm, the entire comparison function

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

仓储在企业的整个供应链中起着至关重要的作用，如果不能保证正确的进货和库存控制及发货，将会导致管理费用的增加，服务质量难以得到保证，从而影响企业的竞争力。传统简单、静态的仓储管理已无法保证企业各种资源的高效利用。如今的仓库作业和库存控制作业已十分复杂化多样化，仅靠人工记忆和手工录入，不但费时费力，而且容易出错，给企业带来巨大损失。

01背包问题最简单实现，可在其上做更多的扩展，不知道可否不用递归用堆栈-01 knapsack problem to achieve the most simple, can do more in its expansion, I do not know can not use recursive stack

用java编的一个学生成绩管理系统，对初学者很有用的哦!-series with a student performance management system, for beginners very useful!

这是一个用于计算最小生成树的程序。当人们逐个输入每条边的权，再点击生成，便能得到这个图的最小生成树。-This is a used to calculate the minimum spanning tree procedure. When people enter one by one each side of the right, then click generate, will be able to get this graph minimum spanning tree.

这是研究生课程计算方法与技术中讲到的UnionFind算法的具体实现代码。-This is the post-graduate courses and technical calculation method described in UnionFind algorithm to achieve the specific code.

Data Structure of maps

JAVA数据结构与算法的二叉树用小应用程序实现-Java data structures and algorithms with small Application Binary Tree Program

10名海盗抢得了窖藏的100块金子，并打算瓜分 这些战利品。这是一些讲民主的海盗（当然是他们自己特有的民主），他们的习惯 是按下面的方式进行分配：最厉害的一名海盗提出分配方案，然后所有的海盗（包 括提出方案者本人）就此方案进行表决。如果50%或更多的海盗赞同此方案，此方 案就获得通过并据此分配战利品。否则提出方案的海盗将被扔到海里，然后下提名 最厉害的海盗又重复上述过程-10 pirates seize a cache of 100 gold, and plan to divide up these spoils of war. This is the democracy of some pirates (of course it was their own unique democracy), their habits are based on the following manner allocation : one of the most powerful pirate proposed distribution plan, and then all the pirates (including the proposal himself) on this program for a vote. If 50% or more of the pirates agreed to this program, this program was adopted and on the allocation of spoils of war. Otherwise, the proposals will be pirates thrown into the sea, and then nominate the most serious piracy repeated this process