## Multiplication Tips »

Multiplying by five Jenny Logwood writes: Here is an easy way to find an answer to a 5 times question.If you are multiplying 5 times an even number: halve the…

29 Sep 2009 / 2 Comments / Read More »## Multiplying a two-digit number by 11 »

For instance, suppose you wanted to multiple 43 x 11. Well, you may be able to solve this problem in your head already if you realize that you can first…

6 Sep 2009 / 3 Comments / Read More »## How to swap the content of two variables without using an intermediate storage location? »

Traditionally most programmers use an extra variable when it’s come to swap the content of two variable. well, some programmers…

20 Apr 2011 / 5 Comments / Read More »## Fastest Algorithm to Find Greatest Common Divisor »

In mathematics, the greatest common divisor (gcd), also known as highest common factor, of two or more non-zero integers, is…

29 Nov 2010 / No Comment / Read More »## Advantage of new[] over malloc() »

If you are a C programmer and just turning to C++, you may be wondering what was wrong with my…

17 Nov 2010 / No Comment / Read More »## Fastest Algorithm to generate primes in c/c++ – Sieve of Eratosthenes »

In mathematics, the Sieve of Eratosthenes is a simple, ancient algorithm for finding all prime numbers up to a specified…

26 Oct 2010 / 2 Comments / Read More »