资源列表
Calcultar
- 本程序虽然只能进行两个操作数的简单的四则运算，程序格式比较清楚，易懂。适合初学者作为参考。-Although this procedure only two operands for the simple four operations, procedures format clearer, understandable. As a reference for beginners.
gauss2.c
- Using Gaussian elimination to solve linear equations. // In this version, we allow matrix of any size. This is done by treating // the name of a 2-dimensional array as pointer to the beginning of the // array. This makes use of the fact that ar
panduan
- 判断文法类型，判断为L(0)或L(1) 很好用，好懂-Grammar to determine the type of judge for the L (0) or L (1) very good, and better understand
shuzhifenxi
- 数值分析中的数值逼近方法以及曲线拟合算法-Numerical analysis of numerical approximation methods and curve fitting algorithm
bitree
- 数据结构完成二叉树遍历，包括递归和非递归-Complete binary tree data structure traversal, including recursive and non-recursive
Simulated_Anealing
- 使用遗传算法求解TSP问题 输入每个城市的坐标文件Location.dat-The use of genetic algorithm problem TSP input the coordinates of every city document Location.dat
fft
- 快速傅立叶变换的C++源码，需要计算 (n * lg n) / 2 次。-Fast Fourier Transform
et
- 一个偶数总能表示为两个素数之和，也即偶数不可能不是两个素数之和。-An even number can always be expressed as the sum of two primes.
Dijkstra
- Dijstrat算法求最短路径，可行性算法分析-Dijstrat
nqueen
- n皇后问题， 数据结构编程（c++语言）-n queeen
good
- 第4章 数组 1. 定义一个int型的一维数组，包含10个元素，分别赋一些随机整数，然后求出所有元素的最大值， 最小值，平均值，和值，并输出出来。 -Chapter 4 Array 1. Define a one-dimensional array of type int, contains 10 elements, respectively, assigned some random integer, then find all the elements of the maximu
binary-tree
- 分别以先序和中序遍历序列，后序和中序遍历序列构造一棵二叉树 要求以括号表示法输出该二叉树-Preorder and inorder traversal sequence after sequence, and the traversal sequence construct a binary tree the brackets indicate the method outputs the binary tree