资源列表
final.rar
- 有以下七种排序法的实现方法，1冒泡排序,2顺序插入排序,3快速排序,4折半插入排序,5希尔排序,6.选择排序,7归并排序，并分析了各种排序法的性能。程序调通了，完全没有问题。,There are seven methods to sort the law, 1 Bubble Sort, Insertion Sort 2 order, 3 Quick Sort, Insertion Sort 4 half, 5 Hill sort, 6. Choose Sort, 7 merge sort, an
POJ_report.rar
- 总共80多道题的POJ详细解题报告，每道题带ppt说明，很好很强大 ,A total of more than 80 questions the POJ report detailed problem-solving, with each title ppt shows that a good strong
GraphTrace.rar
- 用标准C++完成对图的深/广度优先搜索,使用邻接多重表的存储结构,Using standard C++ Completion of the map deep/breadth-first search, the use of the adjacent multi-table storage structure
tanxinfa.rar
- 北京大学研究生课程“算法分析与计算复杂性理论”的课件，讲的是贪心算法。,University post-graduate courses
SearchMedian.rar
- 寻找无序数组的中位数，实际上代码实现了寻找无序数组中任意第x大的数，使用了快排的思想。VC++ 2005环境,Find disordered array median, in fact, code has to find a disorderly array of arbitrary section x large, use the quick thinking of row. VC++ 2005 Environment
UpperNum.rar
- 给定一个数组A，里面只出现0-9这10个数字，但不一定全部出现，然后给定一个K的值，求A中大于K的整数当中最小的一个，并输出。例如A={0，1}， k =12,则结果为100. vc++ 2005环境,Given an array A, which only the 10 digits 0-9, but not necessarily all appear, and then given a value of K, and K is greater than A, the smallest in
OE3.rar
- 本程序给出了SSD5实验课中Optional Exercise3的参考程序 内附有详细的注释 下载后请仔细参照源代码进行分析 切莫完全搬照,This procedure gives the experimental SSD5 lesson Optional Exercise3 reference containing detailed procedures for the Notes Please refer to download the source code for analysis do
01beibao.rar
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！,01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
Data Structures and Algorithm Anal
- C语言数据结构与算法分析，是一本不错的书，高清版，需要较好的阅读能力。,C language data structure and algorithm analysis, is a good book, high-definition version of the need for better reading ability.
Parking.rar
- 数据结构课程设计,实现一个停车场管理模拟的小程序,主要是对栈和队列的经典操作,Data structure curriculum design, the realization of a simulation of a small car park management procedures, mainly for classic stack and queue operation
wine_dividing.rar
- 分酒问题：已知有3个容量分别为3kg,5kg和8kg且没有刻度的酒瓶,3kg和5kg的酒瓶均装满了酒,而8kg的瓶子为空.现要求仅用这3个瓶子将这些酒分为两个4kg,并分别装入5kg和8kg的瓶子中. 提示:回溯,递归算法.最初始的状态为(350),最终的状态为(044),要求求解所有的解法.,Hours of liquor question: known to have three capacity, respectively 3kg, 5kg and 8kg without calibr
数据结构算法解析
- 配合严蔚敏的数据结构的辅导书，内有书中程序的代码实现——高一凡所著的数据结构算法解析的第一章绪论。,YAN Wei-Min with the data structure of the counseling book, there are procedures code book- written by high and one where the data structure algorithm to resolve the first chapter of the Introduction.