资源列表
jiayou
- 用C语言实现的算法题中的加油问题。 用贪心算法实现的。-C language algorithms that the refueling problem. With the greedy algorithm.
guahaotest
- 学习C语言时，编写的一个多项式刮号检查程序 主要用栈实现的。-C language study, prepared by a polynomial scratching, the main inspection procedures Stack realized.
Calculationsme
- 用线性表实现四则运算，很好的一个版本，老师给了满分-achieve linear Table 4 operation, a very good version, the teacher gave full marks
Knapsacktwoinone
- 0-1背包和 背包问题的动态规划 源程序 只是测试 不过要自己输入 还要自己加入 很简单就没有更改-0-1 knapsack problem knapsack and the dynamic programming source code is to test but also to input their own entry is very there is no simple changes
nQueenCircle
- 算法设计中的经典问题，符号三角形，n皇后，圆排列-algorithm design of the classic, triangular symbols, n empress, with a round
mergeinS
- merge sort give a set S of n integers and another integer x, determine whether or not there exits two elements in S whose sum is exactly x.-merge sort give a set of S n integers and anot her integer x, determine whether or not there exits two elemen
span_forest
- Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, \"g++ -o span_forest span_forest.c\". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper t
strassen
- 传统方法与Strassen算法相结合的矩阵相乘算法，可以求出任意两个偶数阶矩阵的乘积！本代码简单,精简，非常好！非常巧妙！没用到什么复杂的东西！经测试完全正确！-Strassen with traditional methods based on the combination of matrix multiplication algorithm, can be obtained even arbitrary two-matrix product! The code simple, concis
DEMO(sort)
- 实现各种内部排序。包括冒泡排序，直接插入排序，Shell排序，快速排序，堆排序，并比较排序的比较次数和移动次数。主要是C语言。-achieve internal order. Including bubble sort, direct insertion sort, Shell sort, quick sort, heap sort, and compare the ranking of number and mobile number. C is the main language.
Imagepintu
- this code show how to use computer sole the poblem to piece image together-this code show how to use the computer sole p oblem to piece together image
Existed_SVL_Tree_Impl
- The existed tree implementation-implementation
AVLTreeImpl
- AVL Tree implementation: I also included a test function to compare the AVL Tree performance with STL Set and Map. Compile the source mavltree.cpp and run it to see the result!-AVL Tree implementation : I also included a test to compare the fu