Search for a command to run...
Series
This series explores how core math ideas shape programming—especially generics and abstractions. Expect elegant patterns, sharp insights, and how math inspires clean, reusable code. Math nerd or code junkie, there's something here for you.
Writing about mathematics and general programming has been on my mind for quite some time, and it makes me very excited to finally begin. In this series, I want to highlight how the concept of algorithms, often considered central to computer science ...
In this article, we revisit Euclid’s algorithm for computing the Greatest Common Divisor (GCD)—an elegant method devised over 2,000 years ago that remains essential in modern computation, from cryptography to compiler internals. Essence of GCD Euclid...
Prime numbers are the building blocks of number theory, yet finding them efficiently has challenged mathematicians for millennia. Among the earliest and most elegant solutions is the Sieve of Eratosthenes—an algorithm devised over 2,000 years ago by ...
