mandeep kaurlovely professional university unit sorting notes contents objectives introduction internal sorting insertion sort algorithm of insertion sort complexity analysis shell sort heap sort merge sort merging of two sorted lists quick sort bucket sort external sorting summary keywords self assessment review questions further readings objectives after studying this unityou will be able toz discuss internal sorting explain heap sortmerge sort and quick sort describe external sorting discuss the implementation of heaps introduction retrieval of information is made easier when it is stored in some predefined order sorting isthereforea very important computer application activity many sorting algorithms are available different environments require different sorting methods sorting algorithms can be characterised in the following two ways simple algorithms which require the order of (written as ( ))comparisons to sort items sophisticated algorithms that require the (nlog ncomparisons to sort items lovely professional university