Insertion sort is a sorting algorithm that works similarly to sorting a hand of playing cards, where individual cards are compared and inserted into the correct position within the sorted hand. The algorithm iterates through an array, comparing each element to its predecessor and swapping elements if out of order until the entire array is sorted.

1. INSERTION
SORT

2. INTRODUCTION
GROUP MEMBERS:
DIMATULAC JONALD
PINEDA VLADIMERE
LACSON APRIL
MANGIO LANCEL
CANLAS CARL

3. THE IDEA OF INSERTION SORT IS SIMILAR TO THE
IDEA OF SORTING PLAYING CARDS.

4. INSERTION SORTING