S3.2 - Analysis of Algorithms

Efficiency is underestimated. Complexity can be measured. Turing Machines define the nature of problems. Computer science is, for the first time, studied in depth!  Join us on this exciting episode where we explain numerous pivotal concepts for the analysis of algorithms as well as some computer science basics!

Also, check out Andrew Sario's podcast, Engineering IRL, on Spotify:
https://open.spotify.com/show/3UZPfOvNwQkaCA1jLIOxp4

or Anchor:
https://anchor.fm/sariodev