1. Explain Performance Analysis of an algorithm.

2. Explain about Binary Search with an example and write an algorithm for it.

3. Sort the following numbers according to Quick Sort {21,44,55,12,7,49} and

Write an algorithm for it.

4. Solve the following recurrence relation T(n)=aT(n/b)+f(n) when a= 2,b=2,f(n)=cn

and

T(1)=1

5. Define an algorithm and Write its specifications.

6. Sort the following numbers according to Merge Sort {3,1,4,1,5,9,2,6,5,3,5,8,9}

and

Write an algorithm for it.