code showing prime number (c++) using recursive function and without using any loop
<p>Thats all in title.<br>
In simple i had write this.</p>

<pre><code>#include &lt;iostream&gt;
using namespace std;  
int main()  
{ 
    int a,i;  
    cout&lt;&lt;"Enter a number: ";  
    cin&gt;&gt;a;  
    for (i=2;i&lt;=a/2;i++)  
    {  
        if (a%i==0)  
        {  
            cout&lt;&lt;"Its not Prime Number.";  
           system ("pause");  
            return 0;  
        }  
    }  
    cout&lt;&lt;"Its a Prime number.";  
    system ("pause");  
    }   
</code></pre>

<p>The main thing is WITHOUT using loop and with recursive function.</p>
