Insertion Sort Algorithm Visualization | Step by Step Python Code Animation

## Description
Sorting Algorithm Insertion Sort acts like a reversed bubble sort, storing a bubble value in a temporary variable and swapping it leftward through the sorted portion until it reaches its correct position. The algorithm then places the stored bubble value into that position.

*Complexity Analysis:*
- Time Complexity: O(n²) — in the worst case, each new element may need to be compared with all previously sorted elements, though the algorithm performs efficiently on nearly sorted data
- Space Complexity: O(1) — sorting is performed in place without additional memory

*Timestamps:*
0:00 — Main Loop
1:23 — Result

*Resources:*
Telegram: https://t.me/benabub_algoviz
GitHub: https://github.com/benabub
Support channel: https://boosty.to/benabub

Видео Insertion Sort Algorithm Visualization | Step by Step Python Code Animation канала Benabub