Programmer Think

At the end of freshman year, I had nothing to do, so I had a whim about whether I could create a simple symbolic game without char character type. Also because I am not a computer major, one of the c language lab assignments in the first semester was to let us play tic tac toe chess by ourselves. At that time, many functions were used for splic ...

ESP822 chip is a development board that can be used as both server and client. When ESP8266 is selected as the client, you can connect to WIFI for network request. After the network is configured, you can use https to request related API s. First show the results: As shown in the figure above, it is 22:41 on December 15 Step 1: drive nixie ...

1. Sequential search Sequential search is the basic search algorithm for traversing and comparing the array / linked list according to the original sequence. 1.1 algorithm implementation Start with the last data element in the table and compare with the key of the record one by oneIf the matching is successful, the search is successful; Conv ...

catalogue For the comprehensive application of circular statements, conditional statements and arrays in C language, comments are provided at the end of each code. I hope you can understand them   Article catalog Catalogue of series articlesprefaceI create a filetwo . preparation3, Test runsummary Preface (required knowledge p ...

Pointer &: take the address character and add it in front of a variable, then the combined symbol represents the address of the variable, such as: int a; int *p； p=&a; Then the address value of variable a is assigned to P A represents the variable a itself, P represents the pointer variable p itself & A represents the address val ...

1. Binary search tree definition Binary search tree (BST) is also called binary sort tree or binary lookup tree Binary search tree: a binary tree, which can be empty; If it is not empty, the following properties are met: All key values of non empty left subtree are less than those of its root nodeAll key values of non empty right subtree are ...

The spanning tree of   graph is the minimum connected subgraph of graph, which contains all vertices in the graph, but only the number of edges 1 less than the number of vertices. No matter how small the number of edges is, it will not be connected. If there is one more edge, there will be multiple paths between vertices. The tree with the ...

preface The first week mainly describes the basic grammar of C language, and the content is relatively simple; However, there are several challenging homework questions. This paper mainly records the class content and challenging homework of this week for self summary after class. 1, 2021 / 12 / 28 - Day1 Day1 describes various prepa ...

catalogue 1. What is the pointer? 2. Pointer and pointer type 2.1 pointer + - integer 2.2 dereference of pointer 3. Field pointer 3.1 cause of formation 3.2 how to avoid wild pointer 4. Pointer operation 4.1 pointer + - integer 4.2 pointer - pointer 4.3 pointer relation operation 5. Pointers and arrays  6. Secondary pointer ...

1. About pathname lookup 1.1 treatment process VFS pathname lookup, that is, how to export the corresponding inode from the file pathname. This process can be briefly described as: check the directory entry matching the first name to obtain the corresponding index node. Then, read the directory file containing that inode from the disk, and ch ...