-
Josephus(data_struct)
数据结构中基于约瑟夫环问题，用C++方式实现的。。。。。(Data structure based on Josephus problem with C++ a manner. . . . .)
- 2013-11-17 11:30:24下载
- 积分：1
-
hannuota
分析汉诺塔，选择合适方法编程实现汉诺塔问题的解答。(Analysis of the Tower of Hanoi, select the appropriate method of programming the answers of the Tower of Hanoi problem.)
- 2012-05-22 18:48:33下载
- 积分：1
-
Josephus
实现约瑟夫问题的4种算法，并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)
- 2012-12-20 12:36:46下载
- 积分：1
-
PolynomialCoeff
NTL应用——大数系数多项式乘法的计算。从文件读如参数，计算多项式相乘后某项的系数(NTL application- the multiplication of big numbers coefficient polynomial )
- 2021-04-11 09:58:58下载
- 积分：1
-
code
C++实现的两类问题随机森林生成算法，对学习随机森林很有帮助(Source code for random forests,wanderful codes,and help youself to it!)
- 2020-06-29 22:20:02下载
- 积分：1
-
class
给定m个n维向量a , a , ,am 1 2 ，向量分类问题要求将相同的向量划分为同一类。试用
抽象数据类型表设计解向量分类问题的有效算法。(Given m a n-dimensional vector a, a,, am 1 2 )
- 2008-05-05 22:03:41下载
- 积分：1
-
maze
迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
- 2013-12-13 17:55:45下载
- 积分：1
-
heapsort
说明： 从最后一个非叶子结点开始从后往前进行调整，保证了根下的所有子树都是最大堆，最后对根进行调整，使整棵二叉树为最大堆，保证了根结点为整棵数的最大值点，完成了建堆的过程，再将根结点跟最后一个结点进行交换，如此反复操作，则堆排序就完成了，其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
- 2008-11-11 22:53:42下载
- 积分：1
-
luciferLanguage
这是acm里关于魔王语言的一道题，通过栈和队列的知识来解决。(this is balout luciferlanguage . i use the datastructure with stack and queue.)
- 2011-11-28 17:04:19下载
- 积分：1
-
3_abstract_data_struct
数据结构：抽象数据类型的介绍；讲述如何构造函数和如何实现；(Data structure: the introduction of abstract data types on how to structure function and how to achieve )
- 2008-04-14 22:56:33下载
- 积分：1
