资源列表
POLYADD
- implementation of Polynomial addition
CQueueLL
- implementation of circular q-implementation of circular queue
StackLL
- Implementation of Stack Data structures
BST
- Implementation of Binary search trees
Looking-for-Palindrome-made-several
- 寻找并输出11～999之间的数m，它满足m、m的平方、m的立方均为回文数。所谓回文数是指其各位数字左右对称的整数，例如121、676、94249等。满足上述条件的数如 m=11，其平方为121，其立方为1331，皆为回文数。要求编制函数 int svalue(long m)实现此功能，如果是回文数，则函数返回1，反之则返回0。在主函数中将三重回文数输出。-Looking for and output 11 ~ 999 between several m, it satisfies m, m sq
BottomUpSort
- 二分排序法，时间复杂度为，最好的排序方法-The C Project is for the Sort of Array BottomUpSort
ADAMS
- ADAMS循环程序得C语言实现，比ADAMSA实现循环功能更简单，而且有实用型，并在无极调试中应用十分成功-ADAMS cycle program have the C language is more simple, than ADAMSA circulation, but also practical, and very successful in the non-polar debugging
sort-course
- 有关排序课程的C++算法，能够合理高效地对不同课程进行排序，非常实用。-It s about a method which can put the courses into order efficiently.
Design-and-analysis-of-algorithms
- 利用一个简单的c程序实现一组数据的排列，重组，实现许多算法设计与分析中的短发结构。-The use of a simple C program to achieve a set of data is arranged, recombine, realize a lot of algorithm design and analysis of hair structure.
C-language-practice-hans-tower
- 简单实现汉诺塔计算，不是很复杂，此过程使用递归算法-Simple to implement han s calculation tower, not very complex, this process using recursion algorithm
haha
- 简单实现a+b,实现acm中的一道经典题型-a simple a+b
quchong
- 生成100个1-100之间的随机数到文件（data.txt），然后读出进行排序和去重后，输出到文件result.txt。(提交源代码和两个txt文件）-Output to generate a random number between 1-100 100 to a file (data.txt), and then read out the sorting and de-emphasis file result.txt. (Submitted to the source code and tw