The mission for this site is to create and curate interactive visual elements that could be used by
current students at MHC in order to better understand some of the more complex algorithms that they
might find in their course.
Modules were designed with the intention to have interactive applications that gave immediate feedback
to a student so that they could learn as they interacted with the program.
We created modules for three algorithms: Stable matching, the maximum sub array sum problem, and the
knapsack problem, unrolling of divide and conquere algorithms, and implemented graph traversals visuals.
We hope to pass this project on to other students who may be interested in working more on this and
create other modules, as there are many algorithms that we did not get the chance to be covered.
Contributors hope to pass on the project to other students who may be interested in working more on this
and creating other modules, as there are many algorithms that we did not get the chance to cover.