Longest Increasing Subsequence Animations

This repository contains a collection of animations designed to helps the leaners visualize the longest increasing subsequence problem. The animations provide an overview of the three primary methods for solving this problem: Naive Recursion Enumeration, Backtracking, and Dynamic Programming. They were created using the Manim animation engine. Here is the YouTube video with explanations using this animation.

Installations

1. Install Manim
2. Run manim -pql fileName.py className.
   To change the quality of the video, change the flag.
3. The animations are saved to the same directory under media/videos.

Example

To run the Naive Recusion Enumeration scene, run manim -pql LcsNaiveRecursion.py CreateLCSTree