O(1) < O(log2n) < O(2^(1/2)) < O(n) < O(nlog2n) < O(n^2) < O(n^3) < O(2^n) < O(n1)
数据结构-时间复杂度大O排名
最新推荐文章于 2024-06-20 16:12:10 发布
O(1) < O(log2n) < O(2^(1/2)) < O(n) < O(nlog2n) < O(n^2) < O(n^3) < O(2^n) < O(n1)