What is time complexity

What is algorithm

The algorithm can be understood as a series of controlled steps , You can achieve some goals or produce some output by performing these steps in sequence .

Time complexity

Time complexity is a function , It qualitatively describes the running time of the algorithm . This is a function of the length of the string representing the input value of the algorithm . Time complexity is often large O Expression expression , The lower order and first term coefficients of this function are not included .

Big O notation

Big O Representation is to convert all steps of the algorithm into algebraic terms , Then exclude the lower order constants and coefficients that will not have a great impact on the overall complexity of the problem .

Time complexity :O(n)

Time complexity ：O(n)

Time complexity ：O(n2)

Common time complexity

The time complexity of common algorithms is in the order of :