tech

Data Structures

Data structures refer to the organization and storage of data in a computer so that it can be efficiently accessed, modified, and manipulated. Understanding data structures is crucial for developers and programmers, as they form the foundation of software development, enabling the creation of efficient algorithms and scalable applications that can handle large amounts of data, making them a fundamental concept in computer science and a key consideration in tech innovation.

Data Structures

Related Stories

A Visual Introduction to Big O Notation

Hashed Sorting Is Typically Faster Than Hash Tables

Bloom Filters Are Good for Search That Does Not Scale

A “frozen” Dictionary for Python

Under the Hood: Vec<t>

My Favourite Small Hash Table

I've Been Writing Ring Buffers Wrong All These Years (2016)

Arenas in Rust

Modern Perfect Hashing

Immer – a Library of Persistent and Immutable Data Structures Written in C++

Clojure Zippers (2021)

Indices, Not Pointers

Cache-Friendly B+tree Nodes with Dynamic Fanout

How to Check for Overlapping Intervals

High-Performance Wavelet Matrix for Python, Implemented in Rust

Cuckoo Hashing Improves Simd Hash Tables (and Other Hash Table Tradeoffs)

Building an Efficient Hash Table in Java

Put a Ring on It: a Lock-Free Mpmc Ring Buffer

Zippers: Making Functional "updates" Efficient (2010)

Concurrent Hash Table Designs