搜索资源列表
AVL_Lib
- Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory
fox
- Turbo C - (C) Copyright 1987, 1988 by Borland International */ #define S_IREAD 0x0100 /* from SYS\\STAT.H */ #define S_IWRITE 0x0080 /* from SYS\\STAT.H */ #define TRUE 1 #define FALSE 0 #define MSGHEADER \"MICROCALC - A Turbo C D
xtsort
- 快速排序算法代码实现，可以对不同格式的数据快速排序。-Quicksort is a fine general purpose sorting algorithm. For different kinds of data, however, it may not be the fastest or the best. For example, it has trouble sorting lists that contain many duplicate values and the al
3230
- 带堆优化的贪心，从题意中我们可以得到的最暴力解法就是，每天都搜索整个数组，找出符合条件的题目并且它的经验是最大的，这样找M天就好了。接下来就是如何优化，在每次找的时候我们只要找经验最大的，因为可以用大顶堆组织可以做的题目，每次升级之后加入新的可以做的题目就OK了。-Optimized with a greedy heap, from the meaning of the questions, we can get the most violent solution is that every d
EvaluateExpression
- 不含变量的整数表达式求值，支持四则运算。栈的典型应用，为学习数据结构的优秀代码。-Non-integer variable expression evaluation, support for arithmetic. Typical applications stacks, data structure for learning the fine code.
rbonce
- this a very fine program which works on all platforms
RBTREE
- this a very fine program which works on all platforms
RBagain
- this a very fine program which works on all platforms
bst
- this a very fine program which works on all platforms
C-algorithm-for-fine-Daquan
- 精编C算法大全，最近收集的最经典的c程序算法-C algorithm for fine Daquan
c
- 精细介绍了c#算法和技术的应用，是很好的一个学习c#的资料，讲解的很详细-Fine introduced the c# algorithm and technology, is a learning c# very good information, to explain in great detail
yinhangjiasuanfa
- 蛮好的一个算法自己改进过，适合于交作业用的啊-A fine improvement over their algorithm, suitable for hand in papers with the ah
Data-structure-course-CPP
- 数据结构方面的书籍，c++的，是刚开始学习数据结构朋友的优秀指导书-Data structure of the books, c++, the data structure is just beginning to learn the fine instructions friends
ArcNode-
- 数据结构精品课程图的讲解（图的应用、图的基本术语、图的基本操作）-Data structure diagram to explain the fine courses
source-codes
- some good programs. its all been corrent and working fine.
NSGA-II
- 相对于NSGA而言，NSGA—II具有以下优点：1)提出新的基于分级 的快速非胜出排序算法，将计算复杂度由 降到 ，其中： 表示目标函数的数目， 表示种群中个体的数目；2)为了标定分级快速非胜出排序后同级中不同元素的适值，也为使准 域中的元素能扩展到整个 域，并尽可能均匀遍布，文献[7]提出了拥挤距离的概念，采用拥挤距离比较算子代替需要计算复杂的共享参数的适值共享方法；3)引入了保优机制，扩大了采样空间，经选择后参加繁殖的个体所产生的后代同其父代个体共同竞争来产生下一代种群，因此有利于保持优良的
binarytree
- 讲递归函数改成非递归可以采用循环的方式，找出第K大的元素也可以变查找边记录，而对于删除某一个范围，可以设置判断条件。一旦满足就调用删除函数。-in order to tranverse a binarytree and you can add or delete a node with the function.you can also fine the biggest one etc.
beibaowenti
- 辅助新手理解一位数组的背包问题 没有别的了 价值真的不大 -good is good oh ok how are you fine think and you
Stack-and-queue
- 用visual c++实现的栈与队列的基本操作。以停车场为例，具有初始化停车场，添加车辆，车辆出停车场，显示所有车位细信息等功能。-With the basic operation of the stack and queue visual the c++ realization. In the parking lot as an example, with initialization parking lot, add the vehicle, the vehicle out of the p