Algorithms + Data Structures = Programs cover image

Episode 123: An Algorithm Taxonomy

Algorithms + Data Structures = Programs

00:00

The Iterative Nature of Multiple Find Ifs Within a Filter

The key thing here is that we are iterating over an underlying range of in elements. And the same can be set about drop, take, remove if whole variety of different range adapters. I agree with what you are kind of saying, but there is a distinction in that the repetitive find ifs that occur implicitly within a filter do not exist within a drop in a take. That's a single one time operation and then once you either take in or dropped,. You actually don't do any iterations to skip elements only in the drop case. It's still an order n operation. Well, I mean, I also wouldn't call it like a nest. When I hear nested loop, I

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app