资源列表
Welltest
- 给出N口井的坐标，把距离小于给定值的分为一组。只要一口井与这一组中有一口井小于给定距离，则它属于这组-N wells given the coordinates, distance less than the given value is divided into one group. As long as a well and the group has a well less than a given distance, it belongs to this group
not0first
- 判断不以0打头的数字串-0 judgment not to the head of Series
TwoDiv
- 数值计算中二分法的一种实现。-two divide
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
linearlist
- 数据结构中链表的实现，linearlist，具有数组不可比拟的优势-Data structure linked list implementation, linearlist, with an array of unparalleled advantages
wavecompression
- compressive sensing in image processing