I wrote these two solutions for Project Euler Q14, in assembly and in C++. They implement identical brute forc
I was looking for the fastest way to popcount large arrays of data. I encountered a very weird effect: Changin
Is if (a < 901) faster than if (a <= 900)? Not exactly as in this simple example, but there are slight p
I am doing some numerical optimization on a scientific application. One thing I noticed is that GCC will optim
So I am learning MSIL right now to learn to debug my C# .NET applications. I've always wondered: what is
I want to have a SPA that's doing all the work client side and even generating some graphs/visuals. I&ap