0712233

说明：  给定程序中，函数fun的功能是：将a所指3×5矩阵中第k列的元素左移到第0列，第k列以后的每列元素依次左移，原来左边的各列依次绕道右边。 例如，有以下矩阵： 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 若k结果为2，程序执行结果为： 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 请在程序的下划线处填入正确的内容并把下划线删除，使程序得出正确的结果。 注意：源文件存放在考生文件夹下的BLANK1.C中 不得增行或删行，也不得更改程序的结构！ (A given program, function fun feature is: a 3 × 5 matrix referred to in the first k elements of the left column to move Section 0, the k elements of each column after column followed by the left, the original columns in the left turn Bypass on the right. For example, the following matrix: 123,451,234,512,345 If k is 2, the program execution results: 345,123,451,234,512 in the program underscore the right content at the fill and to remove the underscore, so that the program reach the right result. Note: The source files in the folder of BLANK1.C candidates are not allowed by the line or delete line, nor change the structure of the program!)

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

冒泡优化： 如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行，优化之后1次就好，也就是说序列越接近于正常序列，改进之后的冒泡排序的次数就越少，这样会给一个冒泡排序算法带了很大的效率。 思想：添加一个boolean变量用来判断冒泡是否是已经排好了顺序，如果boolean的值为false，说明是已经排好了，如果boolean的值true，说明没有排好，继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency. Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)

C语言树的简单实现,介绍了树你前序遍历，树插入与删除节点的实现(C-tree is simple to achieve, before you introduced the tree traversal, tree insert and delete nodes to achieve)

纯C语言编程的模拟现有图书馆的借阅、续借、归还；图书入库、出库；查询、排序等功能，实现电子图书馆的智慧综合管理。其中查询功能里面嵌套精确查询，排序功能有六种，界面可变色，里面已经附带50多本图书信息包括图书摘要等详细信息。里面还附带详细设计报告和解说PPt。(Pure C language programming simulation existing library borrow, renew, return book storage, a library queries, sorting and other functions, to achieve integrated management of electronic library wisdom. Precisely where the query function inside a nested query, sort function has six, the interface can change color, which has included more than 50 books including books summary information and other details. Which also included detailed design reports and commentary PPt.)

最短路径算法。 用无向带全图的邻接矩阵存储图，确定从源点出发到其它各点的最短路径。 输入：图中包含的顶点数n 边数m， 各边权值，用邻接矩阵或者邻接表存储。 输出：源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)

北大ACM1702题 转换为3进制 很经典(NULL)

关于随机发牌算法的小程序，作为数据结构的大作业，开发环境是VC(Random licensing algorithm for small procedures, as big job data structures, the development environment is VC)

矩形件最优排样的程序,用Visual C编写，在6.0下能正常运行。(Rectangular pieces Optimal Nesting program)

约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)