Analyzing algorithms in 6 minutes - Intro

Introduction to analyzing algorithms.
Asymptotic notation video: • Analyzing algorithms i...
Code: github.com/msa...
Source: Introduction To Algorithms, Third Edition (CLRS) [www.amazon.com...]
LinkedIn: / michael-sambol

[@erikawwad7653]

Hey, your videos helped me through DSA at the university of michigan. I have since graduated (last april) and I am just beginning a new job as a SWE working with distributed systems. appreciate everything.

[@MichaelSambol]

You're welcome man. Thank you for watching. Good luck with your new job!

[@dresk2380]

Pretty much same here - thanks Michael, I still come back to a few of your videos every once in a while for a reminder on something because I think you're the most clear instructor I've ever seen on most of these topics

[@littlelilly7480]

These videos are gem, I was searching for big theta noations but unfortunately i couldnt find it:(.
THANKYOU broo u saving lives

[@carl4416]

good timing! Just started DS&A and was looking for an amazing YT teacher. Hope you're well!

[@MichaelSambol]

GL this semester

[@D3ebK]

The GOAT is back

[@probinertasks6087]

Happy 2024. Always appreciate your content.

[@mahermagdy4604]

Great video keep it up

[@DustinWatson01]

Keep it up. Good videos.

[@AccerAspire]

thanks

[@parhamsadeghi6197]

Yay, you're back😎

[@swoorp]

Welcome back!

[@rain_yy]

how do u get those calculations in the 'times' or formulas? still understanding...

[@Var_]

Seems like your insertion sort is broken. Why does it start at index 2 instead of index 1? And even fixing this, it never seems to be able to properly place the lowest number into index 0 (there is no moment where A[0] could be assigning something). Maybe you're assuming the first 2 elements are sorted for simplicity?
Otherwise thanks for the video.

[@MichaelSambol]

I wrote the code to mirror the pseudocode in CLRS. Please see the comments in my GitHub repo: github.com/msambol/dsa/blob/master/analyzing_algorithms/intro.py