Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order (ascending or descending arrangement). The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.
- Time Complexity : O(n^2)
- Space Complexity : O(1)
Selection sort is a sorting algorithm that selects the smallest element from an unsorted list in each iteration and places that element at the beginning of the unsorted list.
- Time Complexity : O(n^2)
- Space Complexity : O(1)
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
- Time Complexity : O(n^2)
- Space Complexity : O(1)
Merge Sort is based on the principle of Divide and Conquer Algorithm.
The MergeSort function repeatedly divides the array into two halves until we reach a stage where we try to perform MergeSort on a subarray of size 1.
After that, the merge function comes into play and combines the sorted arrays into larger arrays until the whole array is merged.
- Time Complexity : O(nlogn)
- Space Complexity : O(n)
Quck sort is a Divide and Conquer Algorithm. It finds a pivot number and makes sure
that all the smaller values are located to the left of the pivot and all the larger values to its right.
Unlike Merge sort extra space is not required.
- Time Complexity : O(n^2)
- Space Complexity : O(logn)
