Insertion Sort - Your Sorting 101 Guide
Insertion sort is an in-place sorting algorithm. Insertion sort works by picking each unsorted element and placing it in its correct sorted
This category contains explanation for various sorting algorithms in computer science.
A sorting algorithm is an algorithm that sorts or rearranges the given array or list in a specific order. This can be lexicographical order in case of strings and characters, and numerical order for numbers and it can be either in ascending or descending order.
There are mainly two categories of sorting algorithms: 1. Comparison based 2. Non-Comparison based. Comparison based sorting algorithms like bubble sort, insertion sort, selection sort etc. rely on comparison operation for sorting elements. Non-comparison based algorithms like counting sort, sorts based on key-values and radix sort, bucket sort, sort based on bits.