Search Articles — Sudonull

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.

https://sudonull.com/arrays-and-cache-o-1-access-optimization

We analyze why sequential access to arrays is 7–10 times faster than random. Benchmarks of strides, matrices, AoS/SoA. Acceleration up to 10× for middle/senior dev.

https://sudonull.com/offline-cache-of-sites-mitm-proxy

Set up local cache of web resources via MITM on Electron. Offline access to documentation, Crawlee crawler, spaces. For developers without network.

https://sudonull.com/stacks-queues-cache-optimization-for-performance-in-c

Learn how to optimize stacks and queues in C for maximum speed. Compare arrays vs linked lists, implement fast ring buffers, and reduce cache misses by 35x.

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.