Assignment -1

1. Discuss the term "algorithmic efficiency," and why is it important when

designing algorithms?
2. What is the main goal of algorithm analysis?
3. List three characteristics of a good algorithm.
4. Describe various Asymptotic Notations used for the analysis of Algorithm.
5. Explain how the "Master Theorem" can be used to analyze the time
complexity of divide and conquer algorithms.
6. Solve the following recurrence using Master Theorem:
a) T(n) = 3T(n/2) + n2 b) T(n) = 3T(n/2) + log2n
c) T(n) = 2T(n/2) + nlog 2n
7. Compare and contrast Quick Sort and Merge Sort algorithms in terms of
divide-and-conquer strategy, partitioning techniques.
8. Demonstrate each step for sorting the below given array using Merge Sort
and Write the Recurrence Relation for Merge sort. 21, 89, 8, 56, 23, 89, 4,
10, 15, 8
9. In the context of the Quick Sort algorithm, explain how the choice of the
pivot element affects the algorithm's performance. Use examples to illustrate
different pivot selection strategies.
10.Write the algorithm for the merge sort. Explain its complexities. sort the
following using merge sort: 75,56,2,34,4,89,50,30
11.Explain the quick sort and also find its complexities. Sort the following
using quick sort: 34,45,12,23,7,9,10,8