Using template metaprogramming in C++, find the GCD of two integers : <p>I want to know a <strong>template meta-programming</strong> solution to the problem of finding the GCD of two numbers using  using the recursive Euclid's Algorithm, given below for your reference. </p>

<pre><code>function gcd(a, b)
    if b = 0
       return a; 
    else
       return gcd(b, a mod b);
</code></pre>

<p>Any help would be highly appreciated!</p>
