An algorithm holds a required result for each input in a finite amount of time, it

ensures the

for the algorithm.

a$)$ Finiteness

b$)$ Effecteveness

c$)$ Simplicity

d$)$ Correctness

Order functions growth from slowest growing to fastest growing,

$6n^3,8n^2,4n,8^{2n},65,lo{g}_{8}n,lo{g}_{2}n,nlo{g}_{2}n$

a$)65,4n,6n^3,8^{2n},lo{g}_{8}n,lo{g}_{2}n,nlo{g}_{2}n,8^{2n}$

b$)65,lo{g}_{8}n,lo{g}_{2}n,4n,nlo{g}_{2}n,8n^2,6n^3,8^{2n}$

c$)65,4n,lo{g}_{8}n,lo{g}_{2}n,nlo{g}_{2}n,8n^2,6n^3,8^{2n}$

d$)6n^3,8^{2n},lo{g}_{8}n,lo{g}_{2}n,nlo{g}_{2}n,8n^{2}65,4n$

Recall the algorithm for Bubble Sort: