Python's path: Common Algorithms and design patterns

Select sort

Complexity of Time

Second, the calculation method

1. The time spent on an algorithm execution cannot be calculated theoretically, and must be run on the machine to be known. But we can not and do not need to test each algorithm, just know which algorithm spends more time, which algorithm spends less time on it. And the time that an algorithm spends is proportional to the number of executions of the statement in the algorithm, which algorithm takes more time than the number of statements executed.

The number of times a statement is executed in an algorithm is called a statement frequency or time frequency. Note as T (N).

Python's path: Common Algorithms and design patterns