## Detailed explanation of Kodori tree

The origin of the Kodori tree?
The original name of Kodori tree is Old Driver Tree (ODT), which is a data structure proposed by a CF competition in 2017, because the title background protagonist is "what are you doing at the end of the day? Are you free? Can you save it?" The protagonist of the data structure is cordolly, so the data ...

Added by **lanmonkey** on *Wed, 23 Feb 2022 06:29:49 +0200*

## School of magic "difference + greed", "line segment tree + greed", "parallel search + greed" and "Kodori tree"

School of magic
Title Description:
Yako likes to collect visible characters without spaces (ASCII code is 33 ~ 126). In her eyes, the value of a character is its ASCII code size, such as the value of 'a' is 97.
So far, she has collected n visible characters excluding spaces, and the ith character is Si. But she wanted to maximize the val ...

Added by **mattsutton** on *Tue, 22 Feb 2022 15:59:10 +0200*

## Fundamentals of genetic algorithm

GA related basic knowledge
(1) Application of genetic algorithm
Function optimization (classical application field of genetic algorithm); Combinatorial optimization (practice has proved that genetic algorithm is very effective for NP complete problems in combinatorial optimization, such as 0-1 knapsack problem, TSP, etc.); Auto-Control; Robot ...

Added by **xengvang** on *Tue, 22 Feb 2022 15:08:59 +0200*

## [c language data structure] stack and queue related operations

Stack
Linear tables that allow insert or delete operations only at one end.
1, Introduction to the basic operation of stack
& InitStack: initialize stack. Construct an empty stack S and allocate memory space.Destroy & stack: destroy stack. Destroy and free the memory space occupied by stack S.Push & S, X: enter the stack. If ...

Added by **ypkumar** on *Tue, 22 Feb 2022 14:23:19 +0200*

## STL topology sorting

preface
My story with topological sorting
The first contact was the class of data structure. However, I was addicted to playing games and didn't understand the code at that time. The second time was the punch in group. The second question of a force deduction fortnightly competition was topological sorting (I used violence to cycle 100 times ...

Added by **hi2you** on *Tue, 22 Feb 2022 07:53:43 +0200*

## keepMoving binary tree sequence traversal deformation and minimum dictionary ordered substring with length k

Let's start with sequence traversal. This is a common problem. Print it according to each layer, as follows:
For Recommendation in Deep learning QQ Group 277356808
For deep learning QQ Second Group 629530787
I'm here waiting for you
1 - sequence traversal and deformation
Sequence traversal is the most intuitive and simplest sequence, that ...

Added by **kelvin** on *Mon, 21 Feb 2022 11:44:53 +0200*

## The basic introduction of graph and depth first traversal and breadth first traversal

1. Basic introduction of figure
1.1 definition of drawing
A graph is a data structure in which a node can have zero or more adjacent elements. The connection between two nodes is called an edge. Nodes can also be called vertices. Undirected graph: the connection between vertices has no direction, such as A-B, that is, a - > b or B - ...

Added by **Dan06** on *Mon, 21 Feb 2022 08:46:53 +0200*

## Deepening and improving JAVA foundation [Chinese]

data structure
Main contents: Introduction to data structure linear structure tree structure
Introduction to data structure
1 what is a data structure
In short, a data structure is a container that stores data in a specific layout. This "layout" determines that a data structure is efficient for some operations and inefficient for ...

Added by **ineedhelp** on *Mon, 21 Feb 2022 06:29:31 +0200*

## Data structure (C language version) -- sorting notes

1. Basic concepts of sorting
Sorting is an operation often carried out in the computer. Its purpose is to adjust a group of "unordered" record sequences to "ordered" record sequences. The purpose of sorting is to facilitate searching.
If the whole sorting process can be completed without accessing external memory, th ...

Added by **zoidberg** on *Sun, 20 Feb 2022 19:35:22 +0200*

## Data structure (C language version) -- find notes

1. Basic concepts of search
Lookup table
A lookup table is a collection of data elements (or records) of the same type.
keyword
A keyword is the value of a data item in a data element (or record), which can be used to identify a data element (or record). If this keyword can uniquely identify a record, it is called the primary keyword ...

Added by **Jack Sparrow** on *Sun, 20 Feb 2022 16:28:34 +0200*