Answer:
The order of the efficiencies is as following:-
10,000 < 2n < nlog(n) < n5 < n!.
Explanation:
10,000 is constant time whatever will be the size of the problem the efficiency will remain the same.
2n this efficiency is linear it will grow proportionally as the size of the problem increases.
nlog(n) this efficiency is is a bit greater than 2n though it will grow faster than 2n but slower than n2 as the size of the problem increases.
n5 this efficiency is very poor.It is growing very rapidly as the size of the problem increases.
n! is the worst efficiency of them all.
n!=n*(n-1)*(n-2)*(n-3)*(n-4)*.......2*1.
It will grow beanstalk in jack and the beanstalk.
This delay in routers is what we called Packetization delay
or also called Accumulation delay. Packetization delay is the time required for
the information to pass on the wires. The data rate of the links that passes
thru the wires cause the delay.
