Selection sort is one of the simplest and inefficient sorting algorithms. Although it is very simple and easy to implement, its inefficiency makes it almost unusable when dealing with large data sets.

This repository presents a comprehensive study of two classic quadratic sorting algorithms—Insertion Sort (Aibek) and Selection Sort (Nargiza)—with a focus on empirical analysis, code quality, and ...