# KabirKang-zz/insertion_sort

> Implementation of insertion sort in Python. Insertion sort works in the way that you would sort a hand of playing cards. You take a card off the table, one at a time, and do swaps to put it in its correct place. The subset of cards to the left of the "pivot" is always sorted.

- **Canonical URL**: https://githubrepo.cloud/repo/KabirKang-zz/insertion_sort
- **GitHub Repository**: https://github.com/KabirKang-zz/insertion_sort
- **Maintainer / Creator**: https://github.com/KabirKang-zz
- **Discovered On**: Oct 6, 2026

---
*Indexed by GitHubRepo (https://githubrepo.cloud). Real-time open-source discovery & telemetry.*