-
20070320list
包括链表的各项操作，添加、删除、修改等。还包括单项连标和双向链表。(including the operation, add, delete, revise. Also including individual targets and even two-way linked list.)
- 2007-03-20 10:39:42下载
- 积分：1
-
paixu
简单选择排序，这是个解决排序问题的一个算法模型之一。(Sort simple choice, this is a solution to a scheduling problem, one algorithm model.)
- 2008-06-24 00:40:18下载
- 积分：1
-
zhebanchazhao
这半查找法 是一种快速查找算法 查找效率比较高 容易实现 理想的查找算法(This search method is a fast and find more efficient algorithms to find easy to implement the ideal search algorithm)
- 2012-05-04 00:03:29下载
- 积分：1
-
约瑟夫环的循环链表实现
约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)
- 2005-07-03 19:38:38下载
- 积分：1
-
heap
实现栈的基本操作，建栈，进栈，出栈，数据结构实现(To achieve the basic operation of the stack, built stack into the stack, the stack data structure)
- 2013-04-03 11:08:37下载
- 积分：1
-
point
用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))
- 2012-12-16 13:14:04下载
- 积分：1
-
library
纯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.)
- 2020-10-30 14:59:57下载
- 积分：1
-
deep-copy
该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
- 2014-01-03 10:46:48下载
- 积分：1
-
Graph
采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。(The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.)
- 2007-12-25 16:55:03下载
- 积分：1
-
arrangement
假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。）
对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。
(Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.)
K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
- 2014-10-22 11:00:45下载
- 积分：1
