资源列表
CPPLinkList_Inverse
- 通过建立链表在没有新建链表的情况下，实现其转置链表，这样时间复杂度会降低！-Through the establishment of a linked list in the case of no new linked list, to achieve the transpose of the linked list, so that the time complexity will reduce!
STL_quene
- 用c++的STL实现大根堆和小根堆，实现相当方便简单，优先队列效率好-Large root heap and small root heap, quite simple priority queue efficiency c++ the STL
blksearch
- 该程序 可以用于实现数据结构中的分块查找-this can be used to select the data you need
prim
- 数据结构中的最小生成树实现，根据核心算法在Visual studio6.0的开发环境中运行成功。-Data structure to achieve the minimum spanning tree, according to the core algorithm in the development environment Visual studio6.0 run successfully.
matrix
- matrix multiply and sum
order
- 插入排序，以r[k+1]作为监视哨改写直接插入排序算法，其中r[1,,,k]为待排序记录。-Insertion sort, to r [k+1] rewritten as Lookouts directly into the sort algorithm, where r [1,,, k] for the records to be sorted.
merge
- 递归实现的二路归并排序，本代码实现了对一个任务结构体按其收益从大到小排序-Recursive merge sort, the code structure of a task descending order according to their income
jp_problem
- a solution to josephus problem with a circular link list. a typical examle of circular link list.
Try-to-write-A-more-B
- 设A＝（a1， ……，am）和B＝（b1，……，bn）均为顺序表，A’和B’分别为A和B中除去最大共同前缀后的子表 试写一个比较A，B大小的算法-Set A = (a1,......, am) and B = (b1,......, bn) are all order list, A "and" B for A and B were removed after the son of the most common prefix table Try to write A more A, B
lszmg
- 最基础的走迷宫问题。 只用栈的思想，不用栈的物理结构。-The most basic of the maze problem. Only the idea of the stack without the physical structure of the stack
Dijstra-_-weice-
- 数据结构中的迪杰特斯拉算法实现程序~~适合初学者-The algorithm for data structure the Dijie Tesla ~ ~ for beginners ~
Test
- 树的线索化，，由于那个最大字段和太大，没能传成，拿这个-Clues of the tree, due to the maximum field and is too large, could not pass into, take this to try! ! !