basics

Data Structure BASICS (21), data structure basics 21DFS Start from a vertex V0, access the vertex, and then search for the traversal graph from each unaccessed adjacent vertex of V0 in sequence, until all vertices having the same path with V0 in the

Data Structure BASICS (18) and data structure basics 18Hash table Based on the set hash function H (key) and the selected method for handling conflicts, a set of keywords are mapped to a finite continuous address set (interval, the keyword "image"

Data Structure BASICS (16) and data structure basics 16Basic Terms of the tree 1. node: {Data Element + several branches pointing to the subtree} 2. node degree: number of branches (number of sub-trees) 3. Tree degree: the maximum degree of all

Data Structure BASICS (17), data structure basics 17 Features of binary sorting tree The binary sorting tree is either an empty tree or a binary tree with the following features: 1. Each element has a key value, which cannot be repeated; 2. If its

Data Structure BASICS (19) and data structure basics 19Double Rotation A single rotation problem sometimes occurs (as shown in ): (If the child node [k1] on the inner side is too deep, moving it one way will not solve the problem)   So there is a

Data Structure BASICS (18) and data structure basics 18 The red/black tree is a self-balancing binary search tree and a data structure used in computer science, A typical purpose is to associate arrays (map/set in C ++ STL ). It was invented by

Data Structure BASICS (15) and data structure basics 15 Base sorting is an internal sorting algorithm that uses the "Multi-Keyword sorting" idea to implement "Single-Keyword sorting. There are two methods to sort multiple keywords: Ranking priority (

Java Memory Model basics and java model Basics Java Memory Model: 1Thread communication: 2Re-sorting: Program EfficiencyHappens-before: If yes, it will not be reordered.Memory barrier command: deprecated sortingData Dependency: a single thread

Python basics 6: formatting characters, colors, and python Basics Character formatting: 1.% placeholder, % s, % d, % 2. Use format. The format is easy to use. It can be centered, %, binary, and character-filling; 1. Use Case of % Tp1 = "I am % s" %

Data Structure BASICS (1): Data Structure Basics Simple implementation of Swap // C language (by-pointer): template bool swapByPointer (Type * pointer1, Type * pointer2) {// ensure that the two pointers do not point to the same object if (pointer1

Data Structure BASICS (12) and data structure basics 12 Features of two-way linked list operation: (1) "query" is the same as a single-chain table; (2) When "insert" and "delete", you must modify the pointer in both directions. However, for a

Data Structure BASICS (6): Data Structure Basics Stack is a linear table that only allows insert or delete operations at one end. It features: first-in-first-out (FILO)/Second-in-first-out (LIFO );   Stack VS. Queue The stack and queue are both

Data Structure BASICS (7): Data Structure Basics Queue A queue is also a linear table with limited operations. It can be inserted only at one end of the table and deleted at the other end of the table. it is characterized by "first-in-first-out

Data Structure BASICS (4): Data Structure Basics Fast sorting is the most popular and the fastest Sorting Algorithm (C ++ STL's sort function is to implement fast sorting); quick sorting) it is an improvement for Bubble sorting. Proposed by C. A. R.

MongoDB BASICS (9) sharding and mongodb Basics Sharding stores data on multiple servers. Mongodb uses sharding to support deployment of very large datasets and high throughput operations. The capabilities of a single server are limited in various

Lua basics [5] I/O file operations, lua Basics -- [Lua file operation-related I/O] ---- You can specify to open a file in a specific directory. If the file does not exist, -- lua will help us create this file under the directory you specified,

Java syntax BASICS (Summary), java syntax basics Summary 1. Keywords: words with special meanings given by a language. Reserved Words: Actually, words that have not been given a special meaning but will be used in the future. 2. identifier: it is

Linux basics [Article 9] and linux basics Article 9 Architecture of adding three disks to the server   Note: 1. linux caches the physical memory that is not used by the system. Therefore, 859 is not the actual memory of the system. 2. The real

Linux BASICS (1), Linux BASICS ( 1. Five methods available for installing linux 1. CD2. Hard Disk3. NFS Image4. FTP5. HTTP There are two scenarios for hard disk installation: A. It is installed on Win System B. The installation is started from other

TCP/IP BASICS (I), tcpip Basics 1. Architecture and main protocols of TCP/IP protocol family The TCP/IP protocol family is a layer-4 protocol system. Data link layer: implements network drivers for Nic interfaces to process data transmission on