Programmer Think

   recently, I was reviewing the data structure. In order to deepen my understanding of B-tree, I sorted out the following notes, and then implemented B-tree in C language; I haven't used C language for a long time. Some parts of the code don't conform to the specification or there are problems in understanding this article. Please co ...

📢 preface 🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌻🌲 Punching out an algorithm problem every day is not only a learning process, but also a sharing process 😜🌲 Tip: the problem-solving programming languages in this column are C# and Java🌲 To maintain a state of learning every day, let's wo ...

Reminder: 1. The pictures taken in this article are from books: Algorithm book for everyone [Japan] written by Shanpu Xian; Jueyun translation 2. The default sorting algorithm in this paper is ascending Sorting algorithm summary: 1. Bucket sorting 2. Selection sorting 3. Bubble sorting 4. Insertion sorting 5. Merge sorting 6. Hill sorting 7. Q ...

2, Linear table 2.1 definition of linear table Linear list: a finite sequence of zero or more data elements (with the same data type) Sequence. There is order between elements. When there are multiple elements, the first one has no precursor, the last one has no successor, and the others have only one precursor and successor.Finite, finite n ...

Hash lookup (hash) In the search of linear tables and tree tables, there is no definite relationship between the position of records in the table and the keywords of records. Therefore, a series of keyword comparison is required when searching records in these tables. This kind of search method is based on "comparison", and the effic ...

Files and streams Due to the needs of the project, it is required to output the image data to the file after processing. In the file, different kinds of data will be displayed in table layout. At first, it was not easy to do, and then try it 1. Basic knowledge To process files in C + +, you must include header files and in the C + + source ...

3.2 travel and implementation of binary tree 3.2.1 travel around binary tree Visiting the nodes of a binary tree in a certain order is called a tour or traversal. Each node is accessed once and listed, which is called the enumeration of binary tree. Generally, the traversal of a binary tree is divided into pre order traversal, middle orde ...

Warning; In modern C + +, we should avoid low-level memory operations as much as possible and use modern structures, such as containers and smart pointers. Use dynamic memory Warning: As a rule of thumb, each time you declare a pointer variable, be sure to initialize it immediately with the appropriate pointer or nullptr! For example, Figu ...

A * preliminary detailed explanation of algorithm Please see Baidu Encyclopedia for details The core valuation function: f(x) = g(x) + h(x) g(x) is the distance function from the starting point, such as how many steps have been taken from the starting point.h(x) is the heuristic search function for the current position to reach the end ...

1, Introduction to fast platoon Quick sort uses the idea of divide and conquer. Its basic idea is: Select a keyword key and place it in the sorted position of the whole sequence through one sorting, and its left sequence is less than or equal to key. The right sequence is greater than or equal to key. Recursively continue the first ...