3min chapter

Lex Fridman Podcast cover image

Donald Knuth: Algorithms, TeX, Life, and The Art of Computer Programming

Lex Fridman Podcast

CHAPTER

Using Asymptotic Notation in the Analysis of Algorithms

In general, what brings you more pleasure is proving or showing a worst case analysis of an algorithm. You popularized the asymptotic notation for describing running time. Do you see any aspects of that kind of analysis is lacking? We have notations that that help us for the problems we want to solve and so that they match our intuitions.

00:00

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode