One of the projects for the Fundamentals of Algorithms (CS 3353) course at Southern Methodist University.
Research one problem that interests you related to algorithms, and find two solutions where one solution is more efficient than the other, analyze your solutions and present the results.
Settled on the Maximum Subarray Problem. The problem is, given an array of integers, find a contiguous subarray with the largest sum.
To view the final presentation, click on the presentation.pdf file in the repository.