1.
Here is the ascending order in terms of complexity:
f_{1}(n) = 10^{20} (Constant)

1.

Here is the ascending direct in stipulations of complication:

f_{1}(n) = 10^{20} (Constant)

f_{7}(n) = lg lg n (Log-of-log)

f_{9}(n) = lg n^{5} = 5lg n (log)

f_{2}(n) = (lg n)^{4} = (Log-exponential complication)

f_{8}(n) = n^{0.1} (Sublinear complication, n-root, n=0.1).

f_{6}(n) = n+lg n (Linear)

f_{4}(n) = nlgn (Linear*Log)

f_{5}(n) = n^{3}-100n^{2} (Polynomial)

f_{3}(n) = 4^{n} (Exponential)

2.

Assort 1: f_{1}(n) = 6000 (The steady complication).

Assort 2: f_{10}(n) = lg lg n^{2} = lg (2lg n) (Log of log complication).

Assort 3: f_{4}(n) = lg n, f_{13}(n) = lg n^{2} = 2logn (Logarithmic complication).

Assort 4: f_{2}(n) = (lg n)^{6} (Log-exponential complication).

Assort 5: f_{11}(n) = n^{0.3} (Sublinear complication, n-root, n=0.3).

Assort 6: f_{5}(n) = n+lg n, f_{9}(n) = 4*n+√n, f_{14}(n) = √(n^{2}+4) (Linear complication).

Assort 7: f_{8}(n) = n^{2}-100n, f_{12}(n) = n^{2} (Polynomial complication).

Assort 8: f_{7}(n) = n^{2}*lg n (Polynomial*Log complication).

Assort 9: f_{6}(n) = n^{3} (Polynomial complication).

Assort 10: f_{3}(n) = 2^n, f_{15}(n) = 3^n. (Exponential complication).