Insertion sort is an algorithm that builds a sorted array one item at a time by taking each element and inserting it into the correct position in the sorted portion of the array. It works by comparing adjacent elements and swapping them if they are in the wrong order, similar to arranging a deck of cards. The algorithm iterates through the array, picking an element and inserting it into the sorted position by shifting greater elements over to make space.

1. INSERTION SORT
VU4S1920008
ATHARVA KATRE

2. WHAT IS INSERTION SORT?
• Insertion sort is the sorting mechanism where the sorted
array is built having one item at a time.
• The array elements are compared with each other
sequentially and then arranged simultaneously in some
particular order.
• The analogy can be understood from the style we
arrange a deck of cards. This sort works on the principle
of inserting an element at a particular position, hence
the name Insertion Sort.

3. ALGORITHM
• Step 1 − If it is the first element, it is already sorted, return 1.
• Step 2 − Pick next element.
• Step 3 − Compare with all elements in the sorted sub-list.
• Step 4 − Shift all the elements in the sorted sub-list that is greater
than the value to be sorted.
• Step 5 − Insert the value.
• Step 6 − Repeat until list is sorted

4. PSEUDOCODE
INSERTION-SORT(A)
for i = 1 to n
key ← A [i]
j ← i – 1
while j > = 0 and A[j] > key
A[j+1] ← A[j]
j ← j – 1
End while
A[j+1] ← key
End for

5. EXAMPLE
Unsorted Array :-
Let’s use
Insertion sort
to sort an
array

9. Sorted Array

10. THE END Thank You