常见时间复杂度参考

常见时间复杂度

1.常数阶O(1)

int i = 0

2.对数阶O(logN)

while(i<n) {
	i = i * 2
}

3.线性阶O(n)

int[] a = new int[n];
for (int i=0;i<n;i++) {
	a[i] = 0;
}

4.线性对数阶O(nlogN)

for (int i=0;i<n;i++) {
	j = 1
	while (j<n) {
		j = j * 2;
	}
}

5.平方阶O(n²)

for (int i=0;i<n;i++) {
	for (int j=0;j<n;j++) {
		int k = i * j;
	}
}

6.立方阶O(n³)

for (int i=0;i<n;i++) {
	for (int j=0;j<n;j++) {
		for (int k=0;k<n;k++) {
			int c = i + j + k;
		}
	}
}

7.K次方阶O(n^k)
n^1/2

i = 2
while((i+1)*(i+1)<n) {
	return i;
}

指数阶(2^n)
斐波那契数列