[Data structs] 四参数随机生成法（2D）

Description: 四参数随机生成法（2D）matlab 代码
Platform: | Size: 6104 | Author: 786742455@qq.com | Hits:

[Data structs] 交叉小波代码xwt

Description: Do the correlation of two factors or the correlation of two factors in time
Platform: | Size: 449536 | Author: 我是你谦哥 | Hits:

[Data structs] c -SPH

Description: SPH code based on C.
Platform: | Size: 508928 | Author: bbowang | Hits:

[Data structs] landmine

Description: THUDSA2019fall. Using stack to find the max area in a rectangle.
Platform: | Size: 1024 | Author: DestinySwords | Hits:

[Data structs] 数据结构代码

Description: Data structure code, including main data types
Platform: | Size: 13593600 | Author: hhhhyz | Hits:

[Data structs] 数据结构 图的应用 最小生成树问题

Description: Application of the minimum spanning tree to practical problems, including problem, code and problem analysis
Platform: | Size: 37888 | Author: 德德20 | Hits:

[Data structs] 排序算法

Description: 排序算法，包括简单选择，冒泡排序，归并排序，快速排序，堆排序
Platform: | Size: 329 | Author: 1849679090@qq.com | Hits:

[Data structs] 二叉排序树_17281183_刘梦婷

Description: 1. Construct a binary sort tree and output it through middle order traversal; 2. Find a keyword in the binary sort tree. If it exists, the search is successful. If it does not exist, insert it into the binary sort tree,
Platform: | Size: 2202624 | Author: lmt19990807 | Hits:

[Data structs] 哈希表_17281183_刘梦婷

Description: The hash table is constructed by using the method of removing and reserving remainder. The loading factor is required to be no more than 0.7. The conflict is solved by linear detection and hashing, and the hash table is
Platform: | Size: 2189312 | Author: lmt19990807 | Hits:

[Data structs] 二叉树_17281183_刘梦婷

Description: The binary list storage structure of binary tree is established according to the extended sequence of traversal in the first order, the recursive algorithm of traversal in the first order, the middle order and the later
Platform: | Size: 2170880 | Author: lmt19990807 | Hits:

[Data structs] 树_17281183_刘梦婷

Description: Establish the storage structure of the tree's child and brother list, and find the depth of the tree. Requirement: 1) Input each edge in the tree from top to bottom (for example, a, AB, AC, BD, b). Do not convert it to b
Platform: | Size: 1536000 | Author: lmt19990807 | Hits:

[Data structs] c语言，码图合集

Description: a set of uestc computer academic matu
Platform: | Size: 6990848 | Author: seayou | Hits: