资源列表
6.44
- 哈夫曼树，二叉树列表，的多元递归算法gfdgfdgd-Huffman tree, binary tree list, the multi - recursive algorithm gfdgfdgd
erchashu
- 判断完全二叉树以及求二叉树深度的递归与非递归算法实现
erfenfadigui
- 用递归实现的二分法，数据结构的典型问题，二分查找也称折半查找，它要求待查找的数据元素必须是按关键字大小有序排列的顺序表。-Realize the dichotomy with recursive data structure of a typical problem, binary search, also known as split-half search, which requires the data elements to be search by keyword must be or
treesearch
- 树的动态查找，包括如何建立树，如何遍历二叉树-The dynamics of the tree to find, including how to build a tree, how to traverse the binary tree
mergesort
- 设有n个待排序元素存放在单链表中，每个链表结点只存放一个元素，头指针为r，试设计算法对其进行二路归并排序，要求不移动结点中的元素，只修改各链结点中的指针，排序后r仍指向结果链表的第一个结点。-With n-elements to be stored in a single list sorted, each linked list node store only one element, the first pointer to r, test their design algorithm fo
main
- 通过栈和队列，求算术表达式的值，能够更深入的理解栈的先进后出和队列的先进先出-Through the stack and queue, find the value of arithmetic expressions, to more advanced understanding of the stack and queue in the FIFO after the
Floyd-algorithm
- 本程序是用C语言来实现Floyd算法，希望对别人有帮助！-The program is implemented in C language Floyd algorithm, want to help others!
shuzhizhuanhuan
- c++数据结构实习 数制转换 输入一个十进制数和要转换成的进制数 计算出结果-c++ data structure internship number system conversion input a decimal and hexadecimal number to convert the calculated results
labe_forOpencv
- 本例使用了opencv中图像数据结构IplImage ：首先进行第一次扫描，标记连通区域；然后对等价标记进行合并，最后进行第二次扫描，对等价标记进行重新标记。-This example uses a data structure of the opencv: IplImage. First, scan for the first time, marking connected region then mark the merger of the equivalence, and final
CrazyLine
- topcoder 694题目A rigorous teacher makes all his students stand in a line before entering the classroom. Being a rigorous teacher, he makes the students line up in non-descending order by height. One time, while the students were lining up, the teacher
bahaunghou
- 皇后问题实现，以棋盘的形式展示，并且输出可行结果-the completeof queen question
Fibonacci
- 斐波那契数列Fibonacci Sequence的Java语言呈现-Fibonacci number Fibonacci sequence Java language presentation