【数据结构】渐进时间复杂度

O(1) < O(log2n) < O(n) < O(nlog2n) < O(n2) < O(n3) < O(2n) < O(n!) < O(nn)

猜你喜欢

转载自blog.csdn.net/qq_43511405/article/details/107754542