How it works:

Insertion Sort builds the sorted array one item at a time by iterating through an input array, and for each element, finding the place it belongs in the sorted list and inserting it there. It's efficient for small datasets and nearly sorted data.

• Time Complexity : O(n²)
• Space Complexity : O(1)
• Best Case : O(n)