1) Algorithms are important because of how crucial they are to so many real world applications. Just a few examples are web searching, file sharing, file systems, compilers. Knowing about algorithms is important because you must know which one to use for a specific problem.

2) a) This will take as long as the original sequence
b) This will take twice as long
c) This will take 4 times as long

 3) Too many variables can affect the measurement of time and so  a basic operation is used to estimate running times instead.

 4) Get the time taken for one iterations then multiply it by the number of iterations required.

5)A) How economical the algorithm is with time and space.
    b) the worst-case complexity of the most efficient algorithm which solves the problem

6)A) How fast an algorithm runs
   B) how much memory an algorithm needs

7)


8) The behaviour of the function(f) for very large values of n.

9)Represents a class of functions that grow no greater than g.

10)

11)	a) growth that has the form K^n
b) an algorithm whose execution time grows exponentially with input size
c)growth that has the form n^k
d) an algorithm whose execution time grows as a polynomial of input size
e)a polynomial time algorithm that exectues in O(n) time