This project was made upon the request of Dr. Ayser Armiti as a final project of Design and Analysis of Algorithms ( 10671210 ) course in Computer-Science Apprenticeship Program at An-Najah National University.
This visualizer uses the Tabulation method of Dynamic Programming (Bottom-Up) to find the LCS (Longest Common Subsequence) between two texts. The Complexity of this algorithm using the Bottom-Up approach is O(m*n) where m and n are the lengths of the first and second texts.
Responsive Grid of Squares (I edited it to fit with my project)