This project is part of an academic assignment designed to enhance understanding of sorting algorithms by implementing them from scratch. The task emphasizes hands-on programming practice, as well as ...

Merge Sort operates by continuously splitting an array into two halves until each sub-array has length 1 or 0 (which are inherently “sorted”). It then merges those sub-arrays step by step to produce ...