care_X 2019-03-10 16:39:07
Description: Using chain storage structure, the univariate polynomials represented by two linear linked lists are added up and output. This one-variable polynomial follows the rule of polynomial addition: when two one-variable polynomials have the same exponential terms, their corresponding coefficients are added. When the sum of coefficients is zero after merging, delete the item in "polynomial" and when the sum of coefficients is not zero after merging, form an item in "polynomial". For the items with different exponents in two univariate polynomials, they are copied to "polynomials" respectively, and the original polynomials remain unchanged.
saiumr 2019-03-10 14:01:10
Description: Introduced some basic but refined algorithms, learning algorithm appetizer.

Description: Data structure algorithm demonstration (Windows version) contains 84 algorithms, which belong to 13 parts.
harry不白 2019-03-06 16:52:02
Description: Data Structure (C++ Language Version) 3rd Edition _Deng Junhui-Tsinghua University
magic9798 2019-03-06 14:47:22
Description: C-Data Structure Course Design, Drug Information Management System
MrDaYang 2019-03-01 21:47:46
Description: The latest edition of data structure textbook of Tsinghua University
onley 2019-02-28 11:37:06
Description: The queue structure is realized by using data structure knowledge. Queue elements can be input randomly, and the function of adding, deleting and modifying queries is realized.
qp1213 2019-02-27 00:20:28
Description: Courseware Code Exercise Answers After Class
ss沙漠飞狐 2019-02-26 19:56:07
Description: This file contains some basic functions and header file about linklist in the study of Data Structure.
wswslzp 2019-02-24 19:27:11
Description: C++ code implementation of B-tree
25son754571662 2019-02-21 16:16:11
Description: Using Python language and recursive method, each element of the whole matrix can be output clockwise. At the same time, the simplified code to implement this method is also written in the py file, which embodies the advantages of Python programming language conciseness.

Description: 1. Create graph class and use adjacency matrix in storage structure. 2. The number of nodes n (no more than 10) and edge m in the input graph are represented by 1-n, respectively. 3. Create a graph by using the m-edges of the input graph of "Starting Node, Terminating Node, Weight Value". 4. Output BFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred. 5. Output DFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred. 6. Output the length of the shortest path from the first node to the n node. If there is no path, output 0.

Description: 1. Enter a series of non-zero positive integers (up to 20), and encounter 0 represents the end of the input (excluding 0). 2. According to the data sequence input above, the maximum heap is created by initialization method (not by inserting nodes sequentially), and then the hierarchical sequence of the maximum heap is output. 3. Output the sorting results after heap sorting. 4. According to the data inputted above, create a binary search tree (keywords are not allowed to repeat, if they are repeated, they are not repeated to insert the keyword), and output the sequence of the binary search tree (line output).

Description: 1 Input a mathematical expression (assuming that the input format of the expression is legitimate), calculate the result of the expression and output it. 2 Mathematical expressions consist of single numbers and operators'+','-','*','/','(,)', such as 2 + 3 * (+5) - 6/4. 3 Variables and outputs are integers, which are not rounded.

Description: 1. Create sorting classes. 2. Provide operations: Selection sort, Bubble sort, Insert sort, Count sort, Quick sort, Merge sort. 3. * can display the intermediate process of various sorting algorithms.

Description: 1. Full permutation of N integers output. 2. Output all subsets of n integers.
wlili 2019-02-19 08:30:19
Description: The program of calculating the depth of binary tree with C language with header file
wlili 2019-02-19 08:28:36
Description: Recursive creation of binary tree and sequential traversal in C language with header file
wlili 2019-02-19 08:25:30
Description: Layer-by-layer traversal and creation of binary trees in C language with header files
wangjindian00 2019-01-28 13:53:12
Description: This book uses a large number of pictures, through detailed step-by-step explanation, in an intuitive and easy-to-understand way to show the basic principles of seven data structures and 26 basic algorithms. Chapter 1 introduces seven data structures such as linked list, array, stack, etc. From Chapter 2 to Chapter 7, 26 basic algorithms related to sorting, searching, graph theory, security and clustering are introduced, including bubble sorting, binary search, breadth-first search, hash function, Duffy-Herman key exchange, K-means algorithm, etc. Instead of boring theories and complex formulas, the book helps readers to understand the principles of data structure and the execution process of algorithms through a large number of step diagrams, which is easy to learn and remember. It's a good choice to use this book as the first step in introducing algorithms.

Description: Data structure foundation, based on c language, contains a large class of data structure

Description: Data structure algorithm
G.D.D.O 2019-01-25 13:51:35
Description: Non-recursive Program for Maze Solving by Stack.The output is one or more sets of paths.
1203486h 2019-01-21 19:05:39
Description: introduction to data structure
qqqqqyf 2019-01-19 20:19:55
Description: A data structure called single linked list implemented by C + + language Head insertion method and tail insertion method are used respectively.
qqqqqyf 2019-01-19 20:15:43
Description: A structure called heaped data volume implemented with C++ language Using the principle of binary tree Determine whether the heap is a heap, distinguish the size of the heap, and adjust if it is not a heap.