About this document
Insertion Sort Proof via Induction by Nazmus Salehin is a document available to read on EtoBox.
The document presents a proof of the correctness of the Insertion Sort algorithm using mathematical induction. It establishes a base case for an array of size one and assumes the algorithm sorts an array of size k correctly, then proves it for size k + 1. The conclusion confirms that Insertion Sort correctly sorts any array of size n ≥ 1.
- Author
- Nazmus Salehin
- Language
- EN