Large 2 O notation

 

1, Big O notation

The execution time or space indicates that the program with the growth trend of the data size.

Operation time complexity of the algorithm

Linear search O (n)

Binary search O (logn)

Disordered array insert O (1)

Delete disorderly array O (n)

Inserting an ordered array of O (n)

Delete an ordered array of O (n)

Bubble sort O (n- ² )

 

2, time complexity

Time complexity, also known as "progressive time complexity", said the growth of the relationship between the code execution time and data volume.

Sort order of increment: Constant order O (1) <logarithmic order O (logn) <linear order O (n) <linearity of the order O (nlogn) <square of order O (N²) ... the cubic order O ( n³) ... k-order square <index order O ( ) <factorial order O (n!).

 

3, space complexity

Space complexity, also known as asymptotic space complexity, represents a growth of relationship between code and data storage space scale.

 

Reference: https: //blog.csdn.net/weixin_38483589/article/details/84147376