## [C/C + + backend development and learning] 1 sorting, KMP, linked list

1 sort Comparison of sorting algorithms Comparison of sorting algorithms (Reprint) Stability of sorting algorithm: Assuming that there are multiple records with the same keyword in the sequence to be sorted, if the relative order of these records remains unchanged after sorting, the sorting algorithm is said to be stable. In sh ...

## Java jdk1.8 source code analysis and the underlying implementation principle of HashMap

This paper analyzes the source code of HashMap with Jdk 1.8 HashMap properties HashMap is a key value pair to store data. key/value can be null, but only one key can be null. The key value cannot be repeated. If the key value is repeated, it will be overwritten.Thread is unsafe. Multiple threads operate the same HashMap instance at the same t ...

## Data structures and algorithms

Basic concepts Data element is the basic unit of data, which is called record. The data structure has two levels: logic and storage; The logical structure is divided into Linear structure: data elements have a one-to-one relationship; Tree structure: data elements have a one to many relationship; Graphic structure: data elements have many ...

## Data Structure Code Title--Day04

Summary of Data Structure Code Title Title 01 Title Description: The data values of the nodes of all elements in a single-chain table with a leading node are out of order. Try writing a function to delete all elements in the table between a given two values 1. Algorithmic ideas Delete nodes under specified conditionsFind the specified node ...

## Software project - student management system

Personal website: Geek communication circle Project introduction demonstration Pre knowledge C language (file operation, structure, loop, selection...) Data structure: two-way circular linked list with short header (tail addition, deletion and traversal) Algorithm: bubble sorting of short bidirectional circular linked list Suggestion: it is ...

## Data structure job 1 unary sparse polynomial calculator

Univariate sparse polynomial calculator [problem description] Design a simple calculator for unary sparse polynomials. [basic requirements] The basic functions of the simple calculator for univariate sparse polynomials are: (1) Input and establish polynomials; The input coefficient is a real number and the input exponent is an integer (2) Outp ...

## LeetCode brush questions -- binary tree 2

level traversal Traverse the binary tree layer by layer, breadth first search. The node is saved with a queue, and the queue is added to the head node. If the queue is not empty, the loop body is executed. Record the length of the queue at the moment and enter another cycle. The length is the number of cycles. Use t to record the header e ...

## Java process control statement

3. Process control statement (application) In the process of a program execution, the execution order of each statement has a direct impact on the result of the program. Therefore, we must know the execution process of each statement. Moreover, we often need to control the execution order of statements to achieve the functions we want. 3.1 cl ...

## Big fish eat small fish (fhq tree / line segment tree dichotomy + greed)

description "Big fish eat small fish" is a classic children's puzzle game. In the game, the "big fish" controlled by the player can only eat the "small fish" whose volume is strictly smaller than his own, and then the volume of the "big fish" controlled by the player will increase the volume of the & ...

## Codeforces Round #746 (Div. 2)

Introduction daily Knowledge points involved Greed, thinking, sorting, bit operation, tree, DFS order Link: Codeforces Round #746 (Div. 2) subject A Gamer Hemose Main idea of the topic: n weapons, each weapon has its own damage value, and the enemy has H health. Each time you traverse these n weapons, you can choose any weapon to att ...