Quick notes on Sorting Algorithm? | Quick revision before exam or interview

  Sorting algorithm is a way to arrange elements  in certain  order. Most widely used order are numerical and lexicographical order.

Some commonly used sorting algorithm are:

1. Selection Sort
2. Bubble Sort
3. Insertion Sort
4. Merge Sort
5. Quick Sort
6. Counting Sort
7. Radix Sort
8. Heap Sort

Short notes on Counting Sort:

• Its running Time Complexity is O(n) with Space Complexity  proportional to the range of data.
• It is not comparison based algorithm.
• It uses partial counting to count the occurrence of the data object in O(1).

Note:- Updating.....