About This Project
In our computer science class, we were tasked with implementing basic sorting algorithms to understand their mechanics and efficiency. this was also our introduction to the ideas of Big O notation and algorithm analysis. I chose to implement two sorting algorithms in Python: Bubble Sort and Merge Sort. Each algorithm sorts a list of numbers in ascending order, demonstrating different approaches to the sorting problem. Here is the github link.
Screenshots & Diagrams