资源列表
linklist
- 数据机构中的双向链表，可用来实现并集，并且是用c++编制-for(i=1 i<=link1.GetLengthofLink() i++) { int e=link1.GetElement(i) if(link2.LinkLocate(e)==0) { newnode=(struct node*)malloc(sizeof(struct node)) newnode->data=e newnod
mergelib
- 这个非常详细的介绍了内排序中的归并排序算法，并分析了它的时间复杂度和空间复杂度。-This very detailed descr iption of the inside of the merge sort algorithm to sort and analyze its time complexity and space complexity.
Depthtraversaltree
- 深度遍历二叉树， 使用C++语言编写的深度遍历二叉树的程序，数据结构的经典程序-Depth traversal tree, using the C++ language program traversing a binary tree the depth of the data structure of the classic procedure
first2
- 程序代码对快速排序法和舍伍德快速排序法的比较-Program code for quick sort and comparison of Sherwood Quick Sort
WORK3X
- 采用顺序映像的方式对队列的相关操作，插入，删除，求其长度，查找头部等-The way by order of queue of eng relevant operation, insert, and delete its length, find head etc
0123
- 华为软件工程师笔试试题，要求实现图的深度遍历算法。-Huawei software engineer written examination papers, the required to the depth of the graph traversing algorithm.
lsp
- ~~~ 北斗程序算法-Beidou navigation algorithm
hdu_1075
- 这是一道杭电1075的题目，里面的解法还不错-Hangzhou Electric 1075
pingguojiufeng
- 数学上有一种分苹果问题，此程序是对它的合理编程- there is a problem of apple problem, this program is for its reasonable programming
MinKDigits
- 用最短的时间寻找最小的K个数，带有详细的解题说明-Use the shortest time to find a minimum number of K
公共子序列
- 本算法实现的是对两个单字符串的扫描，找出其最长公共子序列。-the algorithm to achieve the two-string scan, identify its longest public sequences.
TwoEmbranchmentTree
- TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves. we could check its leaves in terms of algorithm as preorder , midorder or postorder.-TwoEmbranchmentTree : As ancestor has its children, a tree has its leaves. we could check