Insertion sort using (Pseudocode - Python Code - VB.net - Code)

Insertion sort is a simple sorting algorithm that works by dividing the input into a sorted and an unsorted region. Each subsequent element from the unsorted region is inserted into the sorted region in its proper position.
Here's a step-by-step explanation of the insertion sort algorithm:
1. Start with the first element, which is considered sorted.
2. Take the next element from the unsorted region and compare it with the elements in the sorted region.
3. Shift the elements in the sorted region to make space for the new element.
4. Insert the new element into its proper position in the sorted region.
5. Repeat steps 2-4 until the entire array is sorted.
Here's an example of insertion sort in action:
Initial array: [5, 2, 8, 3, 1, 6, 4]
1. Start with the first element: [5]
2. Take the next element (2) and compare it with the elements in the sorted region. Shift the elements to make space: [2, 5]
3. Take the next element (8) and compare it with the elements in the sorted region. No shifting needed: [2, 5, 8]
4. Take the next element (3) and compare it with the elements in the sorted region. Shift the elements to make space: [2, 3, 5, 8]
5. Continue this process until the entire array is sorted: [1, 2, 3, 4, 5, 6, 8]