Programmer Group

preface Hello everyone! I haven't seen you for a long time. The forever is here again. I've been very busy recently, so I haven't updated it for a long time. Last time I introduced the function related knowledge, and then this time we'll have a little episode to show you the tic tac toe game! However, due to the tight time recently, I'll ...

Books recommended by a good friend, take advantage of Thanksgiving holiday to learn! Original in here , you can find a lot of Chinese translations on the Internet. There are explanation videos on a certain station, but I haven't seen them very much, so it's hard to evaluate them. This note is some records and experience in my learning process. ...

Chapter 3: sparse arrays and queues 1. Sparse array 1.1 actual demand The Gobang program has the functions of saving, exiting and continuing the upper board Because many values of the two-dimensional array are the default value of 0, many meaningless data are recorded. We convert them into sparse arrays for storage 1.2. Sparse array appl ...

Chapter 7 sorting algorithm 1. Introduction to sorting algorithm 1.1 introduction to sorting algorithm Sorting is also called sort algorithm. Sorting is the process of arranging a group of data in a specified order. 1.2 classification of sorting algorithms Internal sorting: refers to loading all data to be processed into internal memory (mem ...

1. Red black tree concept First look at the AVL tree: AVL tree is a highly balanced binary search tree Implementation of AVL tree insertion Look at the red and black trees: The Red Black tree is also a binary search tree. However, a storage bit is added to each node to represent the color of the node, which can be Red or Black. By limiting ...

Title Description: Given a source string and a target string, the following operations can be performed on the source string: Insert a character at any position; Replace any character; Delete any character. Write a program to return the minimum number of operations, so that the source string is equal to the target string after the above operat ...

Basic introduction to heap Heap is a special kind of data structure in computer science. Heap is usually an array object that can be regarded as a complete binary tree. All its elements are stored in a one-dimensional array in the order of a complete binary tree, and the value of any parent node must be less than or equal to (greater tha ...

sort 1. Concept of sorting Sorting: the so-called sorting is the operation of arranging a string of records incrementally or decrementally according to the size of one or some keywords. Stability: if there are multiple records with the same keyword in the record sequence to be sorted, the relative order of these records remains unchanged aft ...

recursion The concept of recursion Recursion is a method to solve a problem. It starts from solving each small part of the problem to solving the initial big problem. Recursion usually involves calling the function itself, directly calling itself, or indirectly calling itself, which are recursive functions. Like this: // Call itself directly fu ...

Realization idea AVL balanced binary tree adds the balancing function on the basis of binary search tree, that is, after inserting data according to the rules of balanced binary tree, it is still necessary to ensure that the depth difference between the left and right subtrees of any node does not exceed 1, so as to ensure the query effici ...