函数增长率比较排序 - 算法复杂度分析

1. 将下列函数按照增长率从小到大排序：f1(n) = n, f2(n) = 2n^3, f3(n) = n + 5 * 10^3, f4(n) = n^2, f5(n) = n^3

排序结果：f1(n) < f3(n) < f2(n) < f4(n) < f5(n)

2. 将下列函数按照增长率从小到大排序：f1(n) = logn, f2(n) = log(logn), f3(n) = log(n^2), f4(n) = log(2^n)

排序结果：f2(n) < f1(n) < f3(n) < f4(n)

3. 将下列函数按照增长率从小到大排序：f1(n) = n^2, f2(n) = nlogn, f3(n) = n^logn, f4(n) = (logn)^n, f5(n) = 1.0001^n

排序结果：f2(n) < f1(n) < f3(n) < f4(n) < f5(n)