Pseudocode for Insertion Sorting

[14775 views]

What is Insertion Sort Algorithm

One of the simplest Sorting Algorithms in which every Element is Inserted at a proper place in a Sorted List is called as Insertion Sort Algorithm. In real life, we use Insertion Sort Algorithm to sort the Playing Card.

Pseudocode or Algorithm for Insertion Sort:

Step 1: Start Step 2: If it's the first element, then it's already sorted, return 1 Step 3: Pick the next element Step 4: Compare with all elements in sorted sub-list Step 5: Shift all the elements in the sorted sub-list to the right that are greater than the value to be sorted Step 6: Insert the value Step 7: Repeat until the list is sorted Stop 8: Stop