Recent content by rohits

Prime number : concise code by me any better suggestions ? :unsure: #include <stdio.h> void main() { int num , i; printf("Enter the number :\n"); scanf("%d",&num); for (i=2;i<=num/2;i++) if(num%i==0) break; (i>num/2)?((num!=1)?printf("Prime number...

I am glad u can :bigok: i want ur views on this code as compared to usually suggested code :)

Fibonacci recursion Hi how about following code for fibonacci... it uses recursion, does not do redundant calculations and is simple .... :) #include <iostream> using namespace std; int flag=2,f; void fibo(int a,int b) { if (flag>=f) return; else { flag++; cout << ","...