MindMap Gallery data structure
Summarizes data structure and algorithm knowledge points, including various data structures and search and sorting methods.
Edited at 2021-02-25 09:37:36Avatar 3 centers on the Sully family, showcasing the internal rift caused by the sacrifice of their eldest son, and their alliance with other tribes on Pandora against the external conflict of the Ashbringers, who adhere to the philosophy of fire and are allied with humans. It explores the grand themes of family, faith, and survival.
This article discusses the Easter eggs and homages in Zootopia 2 that you may have discovered. The main content includes: character and archetype Easter eggs, cinematic universe crossover Easter eggs, animal ecology and behavior references, symbol and metaphor Easter eggs, social satire and brand allusions, and emotional storylines and sequel foreshadowing.
[Zootopia Character Relationship Chart] The idealistic rabbit police officer Judy and the cynical fox conman Nick form a charmingly contrasting duo, rising from street hustlers to become Zootopia police officers!
Avatar 3 centers on the Sully family, showcasing the internal rift caused by the sacrifice of their eldest son, and their alliance with other tribes on Pandora against the external conflict of the Ashbringers, who adhere to the philosophy of fire and are allied with humans. It explores the grand themes of family, faith, and survival.
This article discusses the Easter eggs and homages in Zootopia 2 that you may have discovered. The main content includes: character and archetype Easter eggs, cinematic universe crossover Easter eggs, animal ecology and behavior references, symbol and metaphor Easter eggs, social satire and brand allusions, and emotional storylines and sequel foreshadowing.
[Zootopia Character Relationship Chart] The idealistic rabbit police officer Judy and the cynical fox conman Nick form a charmingly contrasting duo, rising from street hustlers to become Zootopia police officers!
data structure
data structure
Concepts: data, data objects, data elements, data structures, data items
survival load (thing) = external internal, Survival force (person) = internal external Survival capacity = Survival power/Survival load
Classification
logical structure
physical structure
type of data
Reasons why there is no need to finish reading a book
①There is a lot of knowledge in the book that we don’t need, so there is no need to waste time
②Value has nothing to do with how much you read, the key lies in being precise and being able to apply it in practice
③Even if what you learn from books has a little effect at work, It is also far greater than the purchase value of the book.
No need to read the book completely
① Reading is not about copying the author’s knowledge system
② It is not necessary, you need to choose specific content.
algorithm
Algorithms and Data Structures
Algorithm characteristics: input and output, certainty, finiteness, feasibility
Design requirements: correctness, robustness, readability, time efficiency and low storage
efficiency measurement method
post hoc statistics
ex ante analysis and estimation method
asymptotic growth of a function
Algorithm time complexity
Algorithm space complexity
linear table
Abstract data type for linear tables
Sequential storage structure of linear table
Storage method
Data length and linear table length
address calculation method
insert, delete
Linked storage structure of linear table
Single list
read
insert delete
create
Delete the entire table
Single linked list structure vs sequential list structure
static linked list
circular linked list
Doubly linked list
Stacks and Queues
stack
Sequential structure and implementation of stack
Stack chain storage structure and implementation
stack application
recursion
Evaluation of four arithmetic expressions
queue
circular queue
Queue chain storage structure and implementation
string
Compare
string storage structure
Naive pattern matching algorithm KMP pattern matching algorithm
Tree
storage structure
Binary tree
nature
storage structure
Traverse a binary tree
Building a binary tree
clue binary tree
Conversion of trees, forests and binary trees
huffman tree
picture
storage structure
adjacency matrix
adjacency list
cross linked list
adjacency multiple list
edge set array
Traverse
depth first
breadth first
minimum spanning tree
Prim's algorithm
Kruskal algorithm
shortest path
Dijkstra's algorithm
Floyd algorithm
topological sort
Critical Path
Find
Sequence table lookup
ordered list search
Binary sorting tree
balanced binary tree
Multi-way search tree (B-tree)
Hash table (hash) lookup
Hash function construction
Hash table lookup
sort
Bubble Sort
Simple selection sort
direct insertion sort
Hill sort
Heap sort
merge sort
Quick sort