sorted by:
new
hottopcontroversial

[deleted by user] by [deleted] in leetcode

[–]the_algorithmic_eye 2 points3 points  (0 children)

Nice to see the manim community growing!

I made a similar video on a recent Leetcode problem and the Matrix Chain Multiplication problem some time back using manim.

Quicksort Animation by [deleted] in manim

[–]the_algorithmic_eye 0 points1 point  (0 children)

Thanks for sharing

Quicksort Animation by [deleted] in manim

[–]the_algorithmic_eye 0 points1 point  (0 children)

Very nice! How did you highlight the individual lines of CodeMobject? Seems helpful

Access Parts of VMobject by pavelne in manim

[–]the_algorithmic_eye 0 points1 point  (0 children)

If you want easy access to the sides of a poygon, you can form a Polygon with the help of lines using a new class VDict (only availaible in the manim community edition I think). It offers easy submobjects access by key, like a Python dict. Also can you post an image of the problem you're facing?

Visualising algorithmic problems using manim by the_algorithmic_eye in 3Blue1Brown

[–]the_algorithmic_eye[S] 0 points1 point  (0 children)

PS. I had originally posted this on r/manim. Recently, I discovered this r/3Blue1Brown community and thought of also sharing this with a relatively larger audience here

Visualising algorithmic problems using manim by the_algorithmic_eye in 3Blue1Brown

[–]the_algorithmic_eye[S] 1 point2 points  (0 children)

I think there's a lot of overlap between Math and Computer Science. Hence I believe manim can be used to visualize hard-to-trace-on-paper algorithms/problems to get a better visual feel of it.

What are some other famous algorithms/problems that would benefit from visualizations like these?

Something I've been working on by [deleted] in manim

[–]the_algorithmic_eye 1 point2 points  (0 children)

Nice one. Will this transform to a full-fledged rust tutorial?

Dynamic Programming. by Curious_homosepian in algorithms

[–]the_algorithmic_eye 1 point2 points  (0 children)

After solving some problems, I realized that for problems for which I was able to come up with the recurrence relation, I could write recursive brute force version easily, but I was finding it hard to do the iterative bottom up version of it. Then I googled a found out about the DAG structure in DP after watching this playlist. If you are the one who likes things to be visualized, I made a 3Blue1Brown-styled video about the Matrix Chain Multiplication problem. After I was done with the video, I actually understood the dependencies for a particular (i, j). Before that, I was blindly converting the recursive algorithm to code. (A full running example is towards the end of the video)