Search Articles — Sudonull

Search Results

In this project

Hash tables and cache conflicts: benchmarks

https://sudonull.com/hash-tables-and-cache-conflicts-benchmarks

Analysis of cache misses in hash tables: chaining vs probing, FNV-1a, Robin Hood. Benchmarks show a 3x speedup. Optimize data structures for real performance — read the details.

Search Algorithms O(log n) vs O(n) in Python

https://sudonull.com/search-algorithms-o-log-n-vs-o-n-in-python

Breakdown of linear, binary, exponential search and hash tables. Code, complexity, selection checklist. For middle/senior developers. Benchmarks and LeetCode examples.

ART Prefix Trees: Memory and Cache Optimization

https://sudonull.com/art-prefix-trees-memory-and-cache-optimization

Learn how to optimize prefix trees from 825 MB to 18 MB. ART benchmarks, radix trees and comparison with hash tables for autocomplete. Real code and metrics.

O(1) vs O(log n) Gap: Cache in Data Structures

https://sudonull.com/o-1-vs-o-log-n-gap-cache-in-data-structures

Why hash table O(1) loses to binary search O(log n) by 40%? Analysis of cache misses, array/list benchmarks and memory hierarchy for RISC-V. Learn real performance.

Perceptual hash: search for similar images

https://sudonull.com/perceptual-hash-search-for-similar-images

How perceptual hashing algorithms work: from simple averaging to DCT. Comparison of methods and practical application for developers.

Trending Now