1
Questions:
1. Write down the name of the design strategy which was used to develop the Merge Sort
algorithm and also explain each of the steps of this algorithm design strategy in one sentence.
2. Sort the array A, A = {9,7,8,3,2,1}, in non-decreasing order using Merge Sort algorithm. Show
steps clearly.
3. Search the array L, L = {2,5,8,12,16,23,38,56,72,91}, for the number 23 and return to the
index of the 23 using Binary Search algorithm. Show the steps clearly.
4. Find the order of growth for the solution of the recurrence 𝑇(𝑛)= 2𝑇 (𝑛
2) + 𝑛 using
Induction Method.
5. Find the order of growth for the solution of the recurrence 𝑇(𝑛)= 2𝑇 (𝑛
4) + √𝑛 using the
Master Theorem Method.
6. Find the order of growth for the solution of the recurrence 𝑇(𝑛)= 3𝑇(𝑛 − 2) using Iterative
(Repeated) Substitution Method.
7. Compare Binary search and Linear Search for the array L to find number 23. Explain worst-
case for a very large number of n (input size).
