MindMap Gallery Overview of Chapter 1 of Data Structure Algorithms
Mind map outlined in the first chapter of the data structure algorithm. Data refers to the carrier of information that can be recognized, stored and processed by computers; data items are the smallest identification units with independent meanings; data elements are the basic units of data, which can be It consists of several data items.
Edited at 2023-09-20 17:18:39Avatar 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!
Overview
Uses and concepts of data structures
the term
data
It refers to the carrier of information that can be recognized, stored and processed by computers.
data item
It is the smallest identification unit with independent meaning.
data element
It is the basic unit of data and can be composed of several data items.
program
algorithm
A good algorithm is a well-defined computational process that takes one or more values as input and produces one or more values as output
The essence of programming is to choose a good data structure and design a good algorithm for practical problems
Advantages and disadvantages of the algorithm:
The algorithm is correct Time to execute the algorithm Storage space for executing algorithms (mainly auxiliary storage space) Algorithms are easy to understand, code, and debug
data structure
logical structure
Describe data in a logical structure, independent of computers
linear structure
nonlinear structure
tree structure
Graphical structure
storage structure
Implementation of logical structure using computer language
sequential storage
array
advantage
High storage efficiency
random storage
Does not take up additional storage space
shortcoming
Inconvenient for data modification, insertion and modification of elements
Linked storage
linked list
advantage
Easy to modify
shortcoming
Low space utilization
Index storage
direction chart
advantage
High search efficiency
shortcoming
To create an index table, space overhead is increased
Hash storage
such as hash table
advantage
Fast search speed
Data operations
Common operations performed on data include addition, deletion, modification, and query
Retrieve, insert, delete, update, sort
Defined on the logical structure, each logical structure has a set of operations
Description and analysis of algorithms
Five Principles of Algorithms
input and output
Finiteness
certainty
feasibility
Algorithmic complexity
subtopic
time complexity
The total number of executions of the algorithm
Depends on the size of the problem and the number of executions
Asymptotic time complexity: refers to the order of magnitude of the time complexity of the algorithm when the problem size tends to infinity.
When evaluating the time performance of an algorithm, the main criterion is: the asymptotic time complexity of the algorithm.
The frequency of statements in the algorithm is not only related to the size of the problem, but also to the values of each element in the input instance.
The time complexity in order of increasing order of magnitude is: constant order 0 (1), logarithmic order 0 (log2n), linear order 0 (n), linear logarithmic order 0 (nlog2n), square order 0 (n²), cubic order 0(n³),...k-th power order 0(n^k), exponential order 0(2^n).
Space complexity: It is the space consumption of an algorithm. It is a function of the size n of the problem solved by the algorithm.
Algorithm complexity: The time complexity and space complexity of an algorithm are collectively called algorithm complexity.
abstract data type ADT
P
Basic operation set for data operations in D
D
data object
R
The set of relations on D
Storage structure considerations: access efficiency, security and confidentiality, modification frequency