Optimization of space-time complexity--mathematics

When solving various algorithmic problems, we often use O () to indicate the time complexity of the algorithm and the rate at which spatial complexity increases as the size of the data grows. Typically, the time complexity that can be solved in 1s time is related to the data size in table 1-1.

Table 1-1 basic time complexity in 1s

The size of n	The time complexity of the solution can be calculated in 1s
10	N! (usually some search algorithms)
20
100	N3
1000	N2;n2㏒n
10000	N√n
100000	N㏒n
1000000	N

Optimization of space-time complexity--mathematics