core.py cover image

Episode 12: WTF Python

core.py

00:00

Efficiencies and Implementations in Sorting and Hashing Objects in Python

The chapter delves into Python's behavior when sorting elements within a tuple, discussing the inefficiencies caused by the sorted function always returning a list. It explores in-place sorting, reversing lists, and the comparison of objects in Python, emphasizing the importance of making objects hashable for consistency in data structures. The speakers highlight the complexities of comparing elements in iterable objects and explain the concept of hash values in Python, including the influence of VM poisoning on hash values.

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