Algorithm Analysis question:

Functional iteration produces the cost T(n) = 1 + 2 + 3 + ... + n-1 + c*n

Which is the proper expression for order of Growth

Question 15 options:

	O(c*n/2)
	O(n2)
	O(n)
	O(1)

Which of the following functions can be considered true for the statement f(n) (n⁵). Select all that apply.

Question 18 options:

	f(n) = n
	f(n) = n3
	f(n) = 2n
	f(n)=n*lg(n)
	f(n) = n5