- pasong 泊松分布的图形算法 本题用c语言编写的画图程序要在tc2.0下运行. 其余程序在各种编译器下可以运行
- trp SA
- xuehuiVote1.3_51aspx 某网站的投票程序
- spectrum-estmation these programs directly and very precisely estimate spectrum of a given signal. these programs are great for class projects in digital signal processing. periodogram
- 函数的最大值 求一个
- 89302380 自制的任务管理器
资源列表
3083
- pku acm上的3083源代码，不过没有解题报告
Montgomery
- 编写的蒙哥马利算法实现，是初学者最好的学习代码。用C语言实现-Montgomery algorithm，the best code for beginners
jisuanqi3
- 利用数据结构栈的思想，按照四则运算加、减、乘、除、幂（^）和括号的优先关系和惯例，编写计算器程序-Stack data structure using the ideas, in accordance with the four operations add, subtract, multiply, divide, power (^) and the priority relations between the brackets and practice procedures for the p
MY_DFS
- DFS is an uninformed search that progresses by expanding the first child node of the search tree that appears and thus going deeper and deeper until a goal node is found, or until it hits a node that has no children. Then the search backtracks, retur
huffman
- 数据结构的HUFFMAN编程，这是我的数据结构的实验，编译通过，内附编译后的结果-HUFFMAN programming data structures, this is my test data structure, compile, compile the results of the included
floyd
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。 -Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to find a given weighted graph algorithm shortest path between vertices.
RecursiveAlgorithmForTransformationOfQuot
- 递归算法改造"求最大公因数"的欧几 里 得 算 法,华大出品-Recursive algorithm for transformation of " seeking the greatest common factor" of the Euclidean algorithm, UW produced
1111111
- ostu 算法源程序C希望对大家有些用 好东西也
shengchengshu
- 8.3.5利用邻接表图的深度优先生成树生成算法-8.3.5 adjacency list graph using depth-first spanning tree generation algorithm
Sequence-table-operation
- 在顺序存储结构实现基本操作：初始化、创建、插入、删除、查找、遍历、逆置、合并运算。-Storage structure in order to achieve basic operations: initialization, create, insert, delete, search, traverse, inverse set, merge operations.
BiTREE
- 输入二叉树的先序序列和中序序列，根据这两个序列，输出二叉树的后序序列,用C语言实现这个程序。-Input sequence and the first sequence of binary tree inorder sequence, based on these two sequences, the output binary sequence after sequence.
Demo
- 数据结构中快速排序的代码实现。快速排序的平均时间复杂度为 log2n,-Data structure in the quick sort code. The average time complexity of the quick sort log2n,