Insert Each Card Into Its Proper Place!
How it works: Like sorting playing cards - pick each card and insert it into the sorted portion.
Time Complexity: O(n²) worst/average,
O(n) best (nearly sorted)
Space: O(1) - In-place
Best for: Small arrays or nearly sorted data