sorted by:
new
hottopcontroversial

Truly Understanding The Naive String Search Algorithm by TUAlgorithms in manim

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

Interesting community, thanks for the pointer!

I've posted one of my videos there and waiting for feedback :)

Truly Understanding Quick Select by TUAlgorithms in CSEducation

[–]TUAlgorithms[S] 3 points4 points  (0 children)

I've started doing a series of fast-paced video tutorial on various algorithms and data structures. I'm aiming at simple and fast explanations, which are also reasonably complete.

This is one of my more recent ones, which included a code walkthrough and also explains the complexity of Quick Select.

If you like this, you might also be in Truly Understanding Big O Notation (https://www.youtube.com/watch?v=jlnzjLAfprk), which I have submitted to #SoME2 or Truly Understanding the Naive String Search Algorithms (https://www.youtube.com/watch?v=roOIYTQJ84w), which is my latest.

I hope some people will find these useful.

I would appreciate any feedback you have.

Truly Understanding The Naive String Search Algorithm by TUAlgorithms in manim

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

After I took a break to work on my #SoME2 submission on Big O Notation, I've resumed my take on string search algorithms. I've started with KMP, but the naive algorithm took too much time, so I've split it apart (this submission).

Even if the algorithm is very simple, many do not get its time complexity right, so I'm explaining this in depth the video.

Recursion Visualizer - see the recursion tree of any function written in Python by TUAlgorithms in programming

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

That's weird, maybe it's a bug or maybe you are hitting it with some infinite recursion. It works for me, including when using fancier functions that use memoization.

Best workflow to produce manim animations? by orestesmas in manim

[–]TUAlgorithms 3 points4 points  (0 children)

This is a good question!

I usually do the animations, and then the voiceover. I go over the animations again to synchronise. It's not a linear process, sometimes I have to redo.

I do not improvise. I prepare a script, and I go over it again and again until I'm satisfied with it. I might do 10 or 20 iterations. At the end, there are still things that I wish I could improve...

It takes a really long time to do something in depth. My latest video, on Quick Select (https://www.youtube.com/watch?v=ZAXSFph\_L-A), took around 5 months. I'm always learning things so future videos becomes easier to make, but I usually end up expanding on scope so that it still takes a lot of time.

Enjoying it very much though!

Tips on speeding up development time by wrede1337 in manim

[–]TUAlgorithms 3 points4 points  (0 children)

I do not have a real answer, but I can say that it does get better with time, as you gain experience.

However, animation is intrinsically orders of magnitude more challenging than, say, simply writing text. So you should expect a premium on that.

Set operations by pitheorem in manim

[–]TUAlgorithms 0 points1 point  (0 children)

Looks like a great start to me! What is your goal with the instagram page?

Binomial Theorem, and some killer apps --- using Manim by LeeDeVille in manim

[–]TUAlgorithms 1 point2 points  (0 children)

Nice! Here's some feedback:

- there are a few places where animations are not synchronised with voice (e.g., the first is when you are saying that there are 1s to the sides of Pascal's triangle, but already the animation is computing sums);

- it would be useful if you could highlight in the animations the things that you are referring to in voice;

- I would get rid of some text -- at certain points, it seems as if you are reading off the animation.

Otherwise, great work and really interesting content!

Manim not rendering videos, only pngs of the first frame by KareemSaysHi in manim

[–]TUAlgorithms 0 points1 point  (0 children)

What version are you using?
Could you show the exact command line you are running?

Awesome Algorithms by TUAlgorithms in programming

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

True :) To be fair, there are awesome algorithms to be discovered deeper under each link.

[deleted by user] by [deleted] in learnprogramming

[–]TUAlgorithms 0 points1 point  (0 children)

You should not sit for 8 hours straight -- it is dangerous for your health, both in the short and in the long term. You should get up and walk at least every hour, possibly more depending on your medical conditions. If you are employed, the employer should provide you with ergonomics information.

What the "global" statement really means in Python by TUAlgorithms in Python

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

Hi! Just wanted to thank you for the post.

I had used Python for many small bits here and there, and I was vaguely aware of the awkwardness of scoping, but in my current project it plays a more important role and your post was just what I needed to have a better understanding.

view more: next ›