In this Algorithm Friyay I demonstrate how to use recursion to free up disk space for your hard drive and how similar it is to working with ASTs.
This is a 1-hour lecture and demo I did for Insiten's Algorithm Friyay. I introduce ASTs (Abstraction Syntax Trees), how to get them in JavaScript, and we write code to traverse an AST. Unfortunately I failed to record the audio for the attendees, so you can only hear one side of our conversations.
This is the second hour-long lecture on ASTs which I did for Insiten's Algorithm Friyay. We finish building a script that can tell which variables in a JavaScript program are unused by traversing an AST of the program.
I give a lecture to the Insiten crew introducing them to dynamic programming. The time-traveling debugger was employed here to demonstrate the performance characteristics of inefficient recursive algorithms.
I continuation of my first lecture on dynamic programming: https://tobyho.com/video/Intro-to-Dynamic-Programming.html. In this one we explore the longest common subsequence problem, a classic example in dynamic programming.