Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list, compares
adjacent elements and swaps them if they are in the wrong order.
- Worst Complexity : N^2
- Average Complexity : N^2
- Best Complexity : N
- Space Complexity : 1
- Method : Exchanging
- Stable : Yes
Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we
first find the maximum element and place the maximum element at the end. We repeat the same process for remaining element.
-
Worst Complexity : N * log(N)
-
Average Complexity : N * log(N)
-
Best Complexity : N * log(N)
- Space Complexity : 1
- Method : Selection
- Stable : No
Quick Sort is based on the Divide and Conquer algorithm that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array.
- Worst Complexity : N^2
- Average Complexity : N * log(N)
- Best Complexity : N * log(N)
- Space Complexity : log(N)
- Method : Partitioning
- Stable : No
Insertion Sort is a simple sorting algorithm that builds the final sorted array one item at a time. It is much less efficient on
large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
- Worst Complexity : N ^ 2
-
Average Complexity : N ^ 2
- Best Complexity : N
- Space Complexity : 1
- Method : Insertion
- Stable : Yes
Selection Sort is a sorting algorithm, specifically an in-place comparison sort. It has O time complexity, making it inefficient
on large lists, and generally performs worse than the similar insertion sort
- Worst Complexity : N ^ 2
-
Average Complexity : N ^ 2
- Best Complexity : N ^ 2
- Space Complexity : 1
- Method : Selection
- Stable : No