Tag
This article explains how Swiss Tables are implemented in Go 1.24's built-in map, detailing the performance improvements and technical internals.
A beginner's guide to algorithms covering linear search, binary search, and depth-first search with JavaScript code examples.
This article explains intrusive linked lists, a data structure variation where links are embedded in the structure itself, used in Linux for efficient memory management and cache performance.
The paper introduces the sync heap, a novel data structure that decouples deletion from revealing the deleted element, enabling constant amortized time for insertions and deletions under limited inspections, and improving a textbook scheduling problem from O(n log n) to O(n).
This document details the time complexity of various operations on Python's built-in types such as list, tuple, and dict, using Big O notation to describe performance characteristics.
A tweet sharing 10 GitHub repositories for mastering Data Structures and Algorithms, including Coding Interview University, The Algorithms, JavaScript Algorithms, and other interview prep resources.
A technical blog post that explores sorting, hashing, and sketching algorithms on a dataset of 370,103 English words, measuring time and memory costs, with a focus on practical implementations like binary search, quicksort, and HyperLogLog.
This article benchmarks the new C++26 std::hive container against std::vector and std::list, showing it has insertion costs about twice that of vector, iteration latency-bound like list, but better locality and erase performance for scattered erasures.
Promotes a free book titled 'Data Structures & Algorithms using Python' covering all types of data structures from arrays to graphs.
Explores parallel algorithms for matching parentheses, a fundamental problem in compilers and text processing.
This paper presents RRB-Trees, a data structure for efficient immutable vectors, enabling logarithmic time concatenation and slicing.
Salvatore Sanfilippo reflects on his earlier prediction that RAG would fade while raw vector search remains valuable, now that the RAG hype has subsided.
A detailed historical and mathematical explanation of hash functions, from their invention by Arnold Dumey in 1956 as a memory indexing technique to modern cryptographic hashes, including Python implementations.
MIT's Advanced Data Structures course (6.851) by Prof. Erik Demaine is available fully online with video lectures and collaborative problem solving.
A blog post exploring the optimization of a ring buffer data structure for storing ping timestamps, discussing tagged unions, bitfields, and struct padding to reduce memory footprint.
This paper presents PivCo-Huffman, a new approach to Huffman coding using pivot coding from wavelet trees, enabling high-performance SIMD-friendly encoding and decoding. It consistently outperforms state-of-the-art Huffman codecs and shows how ANS coding can be selectively applied to skewed nodes to approach ANS compression ratios while preserving high decompression speeds.
Explains how Zig's comptime and type reflection enable creating struct-of-arrays (SoA) data structures like MultiArrayList, which improve cache performance in high-performance applications.
A popular GitHub project providing a comprehensive multi-month study plan for software engineering interviews, covering CS fundamentals, algorithms, system design, and resume tips.
Redis 8.8 is now available with a new array data structure, window counter rate limiter, subkey notifications for hash fields, multiple aggregators in time series queries, and significant performance improvements across various operations.
A technical blog post explaining the benefits of using stacks and queues over recursion for tree traversal, with code examples in Rust.