We investigate how to make faster hash maps, trees, linked lists and vector of pointers by changing their data layout.
All posts tagged data structures
The quest for the fastest linked list
Linked lists are celebrity data structures of software development. They are celebrities because every engineer has had something to do with them in one part of their career. They are used in many places: from low-level memory management in operating systems up to data wrangling and data filtering in machine learning. They promise a lot:…
2-minute read: How is Big O notation relevant on modern systems?
Big O notation is commonly used to describe algorithm performance. But modern hardware makes performance analysis much harder than it used to be. In this short article we give three interesting examples to illustrate the limits of big O notation.