资源列表
leaf_num_tree
- 数据结构中求二叉树的叶子结点个数，适合数据结构使用者。-Binary tree data structure in seeking the number of leaf nodes, the data structure for the user.
digui
- 本段代码实现的功能是：递归实现x的n次幂-The functionality of the code is: recursion x n-th power
xianxingbiao
- 用c语言实现链表的一些基本操作。如插入删除查找等。-Using the C language linked list of some basic operations. Such as insertion and deletion search.
SequentialSearch
- 关键词首次出现位置此程序优化了算法，减少了循环的次数。-Keywords for the first time the location of this program optimization algorithms to reduce the number of cycles.
quicksort_s.c
- sequential quick sort using quick function
4
- 10有两个链表a和b,设结点中包含学号、姓名。从1链表中删去与b链表中有相同学号的那些结点。-10 There are two lists a and b, set node contains student number, name. Deleted from a list and b have the same student number in the list of those nodes.
FIFO
- 模拟内存页式管理中的FIFO算法（用c语言描述）-Analog memory page-style management in the FIFO algorithm (described by c language)
mergesort
- 此程序完成了将链表进行归并排序得功能，主要使用c++编写-This program will be linked to the completion of the merge sort function was mainly written using c++
complex_add_multiply
- 设两个复数A=a+bi, B=c+di(其中a,c为实部,c,d为虚部) 则A+B=a+c+(b+d)i A*B=ac-bd+(ad+bc)i，用单链表实现-complex add and multiply
1012
- 浙大 编程能力测试 的甲级题目 第 1012. The Best Rank (25) 最人性的成绩排序-To uate the performance of our first year CS majored students, we consider their grades of three courses only: C- C Programming Language, M- Mathematics (Calculus or Linear Algebra), and E- English
E_Malevich-Strikes-Back!
- Ural 1221 Malevich Strikes Back代码，简洁明了，通过搜索正方中心坐标并判定来实现- After the greatest success of Malevich s Black Square the famous artist decided to create a new masterpiece. He took a large sheet of checked paper and filled some cells with black. After tha
AVL
- Test program for AVL trees.