Programmer Group

Sets, dictionaries, and hash tables aggregate Collection: consists of an unordered and unique set of items. Tip: aggregate It is a concept in mathematics, but it is applied in the data structure of computer science. Create collection class Generally, the collection has the following methods: add(element): adds a new element to the collection d ...

1, What is Prim algorithm         The process of finding the minimum spanning tree by prim algorithm adopts the idea of greedy algorithm. For a connected network with N vertices, PRIM algorithm finds an edge with the smallest weight from the connected network every time. This operation is repeated N-1 times. The spanning tr ...

Don't read the big talk data structure book clearly. The graph structure is complex, and there may be a connection between any two vertices. Therefore, the relationship between elements cannot be represented by the physical position of data elements in memory, that is, the graph cannot be represented by a simple sequential storage structure. A ...

1. Priority queue 1.1 concept Queue is a first in first out data structure, but in some cases, the data operated may have priority. Generally, when leaving the queue, elements with high priority may be required to leave the queue. In this scenario, it is obviously inappropriate to use the queue. For example, when playing games on the mobi ...

Experimental purpose Understand the data structure and allocation algorithm used in dynamic partition allocation, and further deepen the understanding of dynamic partition storage management and its implementation process. Experimental content (1) The dynamic partition allocation process alloc() and the recovery process free() using the ...

preface When I first learned programming in freshman year, I had a preliminary contact with the concept of recursion. At that time, I also used it to complete several homework problems such as factoring and fiboracci sequence, but I found that up to now, I have been taking the course of data structure and algorithm, and I still have a vague un ...

1. Time and date 1.1 Date class (application) Overview of Date class Date represents a specific time, accurate to milliseconds Date class constructor Method nameexplainpublic Date()Allocate a Date object and initialize it so that it represents the time it is allocated, accurate to millisecondspublic Date(long date)Allocates a Date object ...

Experiment time: 11.10 catalogue Generating complete binary tree Implementation of Morris algorithm Introduction to morris traversal Implementation principle of morris traversal The essence of morris traversal Briefly describe the algorithm process Recursive implementation Experimental results (including time, space and output results) ...

1. Preface For beginners of recursion, recursion is undoubtedly difficult to understand. This series aims to analyze the recursion used in common algorithms to a certain extent, and summarize its recursion model while learning these algorithms. In order to deepen the understanding of recursion, at the same time, when we master a variety of ...

1, Definition of tree A finite set composed of n (n > 0) nodes is an empty tree when n is equal to zero For any non empty tree, it has the following properties: 1. There is a special node in the tree that becomes the root, which is represented by r 2. Other nodes can be divided into m (M > 0) disjoint finite sets T1.T2.T3... Tm, in w ...