Unit-1 Introduction: Algorithms, Analyzing Algorithms, Complexity of Algorithms, Growth of Functions, Performance Measurements, Sorting and Order Statistics - Shell Sort, Quick Sort, Merge Sort, Heap Sort, Comparison of Sorting Algorithms, Sorting in Linear Time. Algorithms - An algorithm can be defined as a finite set of steps, which has to be followed while carrying out a particular problem. It is nothing but a process of executing actions step by step. An algorithm is a distinct computational procedure that takes input as a set of values and results in the output as a set of values by solving the problem. Characteristics of Algorithms Input: It should externally supply zero or more quantities. Output: It results in at least one quantity. Definiteness: Each instruction should be clear and ambiguous. Finiteness: An algorithm should terminate after executing a finite number of steps. Effectiveness: Every instruction should be fundamental to be carried out, in principle, by a per