Search Articles — Sudonull

Search Results

In this project

Binary search trees: O(log n) and cache performance

https://sudonull.com/binary-search-trees-o-log-n-and-cache-performance

Breakdown of real binary search tree (BST) performance in the cache memory context. Why O(log n) is not always fast, comparison with sorted arrays and when to use BST.

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.

Number search algorithms: from Knuth to MCMC

https://sudonull.com/number-search-algorithms-from-knuth-to-mcmc

Breakdown of number guessing strategies in [1,N]: Knuth's maximin O(N²), random O(log N), Metropolis-Hastings MCMC. Code, analysis, benchmarks. Choose the optimal for your N.

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.

Trending Now