Insertion sort is a type of sorting based algorithm that builds the final sorted array (or list) one item at a time by comparisons where we take a key/current element for the comparison. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
Time Complexity for Insertion Sort is = O(N^2)
Space Complexity for Insertion Sort is = O(1)
#dsalgo #datastructures #dsa #insertionsort #java