资源列表
qn1
- 快速矩阵求逆算法，通过此算法可快速对N级矩阵进行求逆运算-rapid matrix inversion algorithm, the algorithm can quickly on the N-matrix inverse operation
Euler
- 这是一个定步长欧拉法程序实现，在c＋＋编译器上调试过了！
largeint
- 学算法的入门算法，也是在acm比赛中经常用到算法，具有非常高的通用性
asdfwcxgf
- 数据结构单向链表的多少功能的实现 建立插入删除查找等功-One-way linked list data structure functions realize how much set up to insert delete search such as reactive
stack
- 堆栈操作，用来实现大树精确加法，可以任意数的位数-stack
adapter_designpattern
- * Coupling between classes and class libraries is a major maintenance * headache. To ease this problem, often the client talks to an * abstraction descr iption, which in turn calls an implementation. * Sometimes these must evolve - when o
B-tree
- 输入一棵二叉树的扩展的前序序列，经过处理后生成一棵二叉树，然后对于该二叉树输出前序、中序和后序遍历序列。-Enter the extension of a binary tree sequence of the first order, a binary tree generated after treatment, then the binary output for pre-order, the order and post order traversal sequence.
Proba
- It cant calculate anything
Ex2
- 用两个栈实现队列，新颖 新颖 新颖 -Queue with two stacks, novel novel novel novel novel novel
stack
- 展示了如何用栈实现迷宫功能，体现了回溯思想-Shows how the stack functions to achieve the maze, reflecting back ideas
jihe
- 集合。。 。。 。。 。。 。。。数据结构-Collection. . . . . . . . . . . . . . . . . . . Data Structures
btree
- 利用fortran编写的二元树排序例子，是利用fortran排序的经典例子-Fortran prepared utilizing binary tree sort example, is sort of a classic example of the use of fortran