Bannalia: trivial notes on themes diverse

C++ unordered associative containers make the beautiful promise of (average) constant time insertion provided hashing is done properly. Let...

In a prior entry we reviewed the data structures used by some popular implementations of C++ unordered associative containers without dupli...

Unordered associative container is a fancy name adopted by C++ for what the rest of the world refers to as a hash table . With the 2011 rev...

Let's study some statistics of a hash table based on closed addressing . We call N the number of elements inserted into the table and ...

Tim Harford recounts in his book The Logic of Life an anecdote about the authors of Freakonomics , Steven D. Levitt and Stephen J. Dubner: ...

In a recent article , Andrew Koenig argues that break statements are harmful because they make it harder to deduce the program context at l...

Consider the sentence Rationalism has many followers. What in principle looks like a rather dull N+V+O statement does not however allow for ...