"Data Structure (C Language Edition)"-Dong Shufeng Study Notes

This edition, which was published in 18 years and compiled by a professor at Zhejiang University, has strong content orientation (easy to understand and easy to remember) and strong applicability. recommend

introduction

1.2 What the book talks about

• The definition of data structure : it is the way a computer stores and organizes data. It is a collection of data elements that have one or more specific relationships with each other.
• Why study data structure : In order to learn the idea of ​​programming to solve problems. Facing a problem is, using the idea of ​​data structure, we can understand how difficult it is to solve this problem and how to solve it is the best.

1.3 Mathematical knowledge

• Exponential, logarithm
• Series
  
  
  3. Modular operation
  

algorithm

learning target

• Estimate the time required for a program to run
• How to reduce program running time
• Consequences of improper use of recursion
• An effective algorithm for multiplying a number by its power and calculating the maximum factor of two numbers

2.1 Mathematical foundation

Newly learned four theorem concepts: (combined function, growth rate, set)

2.2 Model

Calculation model: (ideal, simple)

• Suppose you need a unit of time to do any simple job.
• The computer has unlimited operating space.

2.3 Issues to consider

The following factors affect the time it takes for the computer to run the program to solve the problem:

• Choice of algorithm
• The size of the data to be processed
• The language in which the computer writes programs, the higher the language level, the longer the computing time.
• The quality of the machine code formed by the compiled code
• The speed at
  which the computer executes. The first two are factors to be considered, and the last three are uncontrollable factors. And the first point above has the greatest impact on running time. We are most concerned about the worst operating conditions .