资源列表
Joseph_Central
- 数据结构中的经典问题，约瑟夫环在C++中的具体算法实现-Data structure of the classical problem, Joseph Ring in C++ algorithm specific
friend_enemy
- 带路径压缩的并查集扩展形式,用于动态维护查询friend-enemy型等价类,维护和查询复杂度略大于O(1)-With path compression and expansion of the form of search set for the dynamic maintenance queries friend-enemy type of equivalence classes, maintain, and query complexity, slightly larger than O
333
- 使用c++实现的，最有装载问题，很有用的资料！-Using c++ implementation, the most loaded questions, useful information!
maopaopaixu
- 经典是排序方式，冒泡排序法实例。可以详细了解冒泡排序过程。-Classic is the sort, bubble sort method instance. Can learn more about the process of bubble sort.
mat_mult
- c++ program for matrix multiplication
queens
- 女皇排序问题的简单实现-simple achievement of Eight Queens Problem using Python
p_insert_sort
- 经典的插入排序算法，提供初学者阅读借鉴，C语言编写。-Classical insertion sort algorithm, providing beginners learn to read, C language.
erchalianbiaoqiuyezijiedian
- 该程序是数据结构中二叉树以链表形式存储时求叶子结点，用C++语言描述的-The program is in the binary tree data structure to the linked list is stored and the leaf nodes, C++ language to describe
6-281new
- 顺序表A、B和C递增有序，在A表中删除既在B中出现又在C中出现的那些元素，特别注意算法的时间复杂度。-Sequence tables A, B and C increments ordered removed in Table A in both those elements in C, B, and pay special attention to the time complexity of the algorithm.
matrix
- 本实验实现了稀疏矩阵的转置，为数据结构必做实验，仅提供cpp文件，读者可在编译器上自行编译实现。-The experimental realization of a sparse matrix transpose, the data structure must do the experiment, only cpp file, the reader can compiler to compile your own implementation.
segment_tree
- NotOnlySuccess线段树模板，非常简洁，易于效仿-NotOnlySuccess segment tree templates, a very simple, easy to follow
nmi
- NormalizedMutualInformation(NMI),areusedtomeasure the clusteringperformance