C++

Determine the running times predicted by the detailed model of the computer for the following program fragments:

Int Sum (int x, int n)

{

int sum = 0;

for ( int i = 0; i <= n; ++i)

sum = sum *x +1;

return sum;

}

Repeating question 2, using the simplified model of the computer.

Solve the recurrence relation T(n) = 2T(n/2) +1 given that T(1) = 1.

Using the definition of Big O, show that T(n) = 3n²+5n +2 is O(n²)

What is copy constructor? How to use it?

Which grows faster: n*log(n) or n².

Choose a member function in the Unsorted and Sorted List (Array based and LinkedList based) that we discussed in class. Use diagram or pseudocode to explain how it works and how to implement.

Be able to write recursive function for a given problem.