<<< Sorting Algorithm

1. Properties of Sorting Algorithm: e.g. 

1. Purpose of sorting: e.g.  

1. Insertion sort O(n^2)

2. Merge sort O(n log n) e.g.

1. Time Complexity: e.g.

1. Recurrence Tree method:  T(n) = 2T(n/2) + O(n)

2. Master method:  O(n log n)

2. Auxiliary Space:  O(n)

3. Algorithmic Paradigm: Divide and Conquer

4. Sorting in Place: No in a typical implementation

5. Stable: Yes  

3. Heap sort O(n log n)

4. Quick sort

5. Radix sort

#Programming #Algorithm #CodeAnalysis #SortingAlgorithm #AbdurRahimRatulAliKhan

>>>