Kruskal

在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数. (In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers.)

马踏棋盘的贪心算法，8*8棋盘，基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)

链表L，创建公有成员函数Split（A,B ），创建2个新表A,B，使的A 中含有L中奇数位置元数，B中含L偶数位置元数 (Chain L, create public member function Split (A, B), to create two new tables A, B, A so containing L odd position of a few yuan, B-L even a few locations yuan)

流水线车间的零件加工排序问题，以达到最优的加工顺序，使加工时间最短或零件后期维护费用最少(Plant parts processing pipeline scheduling problem, in order to achieve optimal machining sequence, so that the processing time of the shortest or least parts later maintenance costs)

该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)

说明：  有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

哈希表 数据结构课程设计 1.1问题描述 针对自己的班集体中的“人名”设计一个哈希表，使得平均查找长度不超过R，完成相应的建表和查表程序。 1.2基本要求 假设人名为中国姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。构造哈希函数，用链表法处理冲突。 1.3测试数据 读取熟悉的30个人的姓名作测试。(Hash table Data Structure Course Design 1.1 Description of the problem For their own class group of the "names" to design a hash table, making the average search length does not exceed R, the completion of construction of tables and look-up table corresponding procedures. 1.2 Basic requirements Assuming the name of the person called Chinese pinyin form. To be filled into a hash table names a total of 30, taking the average search length of the upper limit of 2. Construct a hash function, treatment with a list of conflict. 1.3 Test Data Read the familiar names of 30 individuals tested.)

关于C语言的一些指针的处理算法，能够使得初学者对C语言指针有自己的了解(Some pointers on C language processing algorithms, it is possible to make a beginner C language pointer has its own understanding)

各种排序算法的实现，如快速排序，冒泡排序，选择排序，堆排序，二分插入排序等(Implementation of various sorting algorithms, such as quick sort, bubble sort, selection sort, heap sort, binary insertion sort, etc.)

说明：  操作系统先来先服务调度算法模拟（C描述）(Operating a first-come first-served scheduling simulation (C description))