exp2-1

简单选择排序，这是个解决排序问题的一个算法模型之一。(Sort simple choice, this is a solution to a scheduling problem, one algorithm model.)

上海交通大学数据结构课程的课后作业系列3.5：仅供参考，最好还是自己去写(Shanghai Jiaotong University data structure course homework Series 3.5: for reference, it is best to write their own)

图的遍历的实现，文字界面，包含深度遍历和广度遍历两种情况~~(Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~)

最长d维箱嵌套问题的贪心算法， 采用贪心算法不能得到整体最优解, 但其最终结果也可以是最优解的很好的近似(The Greedy Algorithm of the Longest Nesting of d一Dimenson Boxes)

说明：  子集和数问题.rar，用C++写的，可以运行(Subset of several problems. Rar, written in C++, you can run)

some problems about c++.(car.cpp)

数据结构与程序设计中的重点例子程序：八皇后问题(Data structure and procedures of the focus of the design example of the procedure: eight queen problem)

本代码是通过C语言来实现贪心算法求着色问题,包括具体问题和实现代码(This code is the C language to implement the greedy algorithm for the coloring problem, including specific issues and the implementation code)

这半查找法 是一种快速查找算法 查找效率比较高 容易实现 理想的查找算法(This search method is a fast and find more efficient algorithms to find easy to implement the ideal search algorithm)

说明：  约瑟夫算法，适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)