Big O Notation can be scary. But it doesn't have to be! We unpack this popular cs topic and show you how we can use it to evaluate different data structures (like linked lists!) and make better programming decisions.
This episode of the Basecs podcast is based on Vaidehi's blog post, What's a Linked List, Anyway? [Part 2] from her basecs blog series.
Thank you for supporting the show!