资源列表
mul
- 此汇编程序可进行任意位数的相乘只需修改内数组的数值即可 此程序以1234与4567为例-compilation procedures can be arbitrary multiplication of the median only changes within the array of numerical procedures to be like 1234 and 4567 as an example
02
- 编制通用子程序:（1）雅可比迭代格式 （2）高斯-赛德尔迭代格式 （3）SOR方法格式-The preparation of common subroutines: (1) Jacobi iteration scheme (2) Gauss- Seidel iteration scheme (3) SOR method format
insertion
- is the other (and by far the most popular) in-place non-recursive sorting algorithm used in this test. Heap sort is not the fastest possible in all (nor in most) cases, but it s the de-facto sorting algorithm when one wants to make sure that the sort
Huffmancode1
- 按照一定的规则构造哈弗曼树，使得输入的元素都作为叶子节点，然后从叶子到根逆向球每个字符的哈弗曼编码-According to certain rules of construction Havermann tree, making the input element as a leaf node, and then reverse the ball from the leaf to the root code for each character Havermann
CGAUSS
- 高斯主元消去法 c源码 4阶矩阵 已有初始数据 使用时请修改-Gaussian elimination c principal component matrix of order 4 have been the initial source of data used, modify
Cjuzhen
- 用C语言编写的矩阵运算系统，可以实现矩阵的加减乘除算法。-Matrix with the C language computing system, can achieve matrix addition, subtraction algorithm.
list
- 给定两个升序链表，将它们逆序输出并合并成为一个新的升序链表-Given two ascending lists, reverse output and merge them into a new list in ascending order
binarysearch.c.ZIP
- this program gives manipulations on binary search trees
BinarySearchTree
- 用C++实现了二叉排序树的插入和删除操作，对于如何用链式结构实现树的各种操作是一个很好的学习源程序，经调试没有错误。-Achieved with C++ binary sort tree insertion and deletion operations, chain structure for how the various operations to achieve the tree is a good learning source, no errors after debugging.
Finite Difference Laplacian
- Finite Difference Laplacian This demo illustrates the computation and representation of the finite difference Laplacian on an L-shaped domain.
Priority_Queue
- Priority Queue for C
guibinpaixu
- 归并排序和二叉线索树的c++源码，有详细注释-Clues to merge sort and binary tree of the c++ source code, there are detailed notes