Early university project implemented in C as part of an introductory algorithms course. The goal was to implement and compare Shell Sort and Heap Sort by counting the number of element comparisons and ...

This repository contains an extended version of the Insertion and Selection Sort comparison program. It has been refactored and enhanced to be more modular, easier to maintain, and more feature rich.

The biggest problem with a bubble sort is that it takes a very long time to run. For example, if there are 100 values to sort, each pass through the list will take 99 comparisons – and you might have ...