S3.2 - Analysis of Algorithms

S3.2 - Analysis of Algorithms

Update: 2019-01-301
Share

Description

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

Comments 
00:00
00:00
x

0.5x

0.8x

1.0x

1.25x

1.5x

2.0x

3.0x

Sleep Timer

Off

End of Episode

5 Minutes

10 Minutes

15 Minutes

30 Minutes

45 Minutes

60 Minutes

120 Minutes

S3.2 - Analysis of Algorithms

S3.2 - Analysis of Algorithms

Andres Arriaga