Programmer Think

Review the old and know the new - > data structure - > sorting - > program implementation 1_ Using C language This blog is based on Review the old and know the new - > data structure - > sorting Part of the theoretical knowledge of sorting in the program! Among them, three kinds of quick sorting in exchange sorting, recursive a ...

Definition: Binary heap is a special kind of heap. Binary heap is either a complete binary tree (binary tree) or a nearly complete binary tree (binary tree). There are two kinds of binary heaps: the maximum heap and the minimum heap. Maximum heap: The parent node's key value is always greater than or equal to the key value of any child node; M ...

Basic concept and implementation of linear table Definition of linear table A linear table is a finite sequence of data elements with the same characteristics. The number of elements contained in the sequence is called the length of the linear table, expressed in n. Note: n can be equal to 0, indicating that the linear table is an empty t ...

Algorithm series (II) parallel search set Algorithm - joint search set prefaceQuick FindQuick UnionWeighted Quick UnionWeighted Quick Union for path compressioncompare preface It is used to solve the problem of dynamic connectivity. It can dynamically connect two points and judge whether the two points are connected. methoddescribe ...

1. Criteria for measuring sorting algorithms In fact, almost all algorithms can be measured from several convenience: execution efficiency, memory overhead and stability. The sorting algorithm is the same, mainly from: • time complexity, including: best case, worst case, average time complexity, and the number of comparisons and exchanges ...

Data structure and algorithm learning notes (9) search I Basic concepts of search Lookup table What is find How to find Purpose of search Classification of lookup tables Evaluation index of search algorithm Research content of search process II Lookup of linear table 1. Sequential search Scope of application Static l ...

1, The concept of red black tree Red Black tree is a binary search tree, but a storage bit is added on each node to represent the color of the node, which can be red or Black. By limiting the coloring mode of each node on any path from root to leaf, the red Black tree ensures that its longest path does not exceed twice the shortest path, so ...

The so-called nested form of recursion, according to my understanding, is that the form of recursion is relatively complex, which can not be made clear in a simple sentence. This requires two layers of recursion for nesting to achieve the purpose. For example, to calculate the number of nodes in a binary tree, the fundamental logic to solve thi ...

Neusoft campus navigation assistant Function description 1. Design the campus plan. Among them, there are at least 12 representative places. The vertex in the plan represents the representative place in the school, and the weight on the edge represents the distance between the two points; 2. In order to realize the management of the sub func ...

preface Hello, I'm "programmer bear" from Huawei. Most children's shoes know that when solving problems related to "linked list", the commonly used problem-solving routines mainly include "double pointer", "iteration" and "virtual head node". Today, "Little Bear" introduces the strat ...