int main()
{
fun(14);
getch();
}
void fun(int n)
{
if(n<=0)
{
printf("\n%d",n);
return ;
}
printf("\n%d",n);
fun(n-5);
printf("\n%d",n);
}
On Aug 31, 2:24 pm, teja bala <[email protected]> wrote:
> #include<stdio.h>
> void fac(int a)
> {
> if(a>=0)
> {
> printf("%d\n",a);
> fac(a-=5);
> }
> if(a>=0)printf("%d\n",a);}
>
> main()
> {
> fac(15);
>
> }
>
> On Wed, Aug 31, 2011 at 11:09 AM, Dheeraj Sharma <
>
>
>
>
>
>
>
> [email protected]> wrote:
> > int num=15 //global variable
>
> > void fun()
> > {
> > if(num<=0)
> > {
> > printf("0\n");
> > return;
> > }
>
> > printf("%d\n",num);
> > num-=5;
> > fun();
> > num+=5;
> > printf("%d\n",num);
>
> > }
>
> > On Wed, Aug 31, 2011 at 10:59 AM, bharatkumar bagana <
> > [email protected]> wrote:
>
> >> can u pls tell me the answer for the 2nd question..
>
> >> On Tue, Aug 30, 2011 at 12:04 PM, Dheeraj Sharma <
> >> [email protected]> wrote:
>
> >>> yeah it came yesterday..the paper was very easy
> >>> 1.u have to find loop in linked list..
> >>> 2.u are given a number..you have to print it down to zero(subtracting 5)
> >>> and then print from 0 to that number(adding 5) without using local
> >>> variables.
> >>> 3.two C questions ..that were very easy..
> >>> 4.Print the sum of the even terms occuring in Fibbonaci (till 1000 terms)
>
> >>> rest i dont remember..as i didnt gave the paper..this is what my frnds
> >>> told me..
>
> >>> On Tue, Aug 30, 2011 at 9:23 PM, rahul sharma
> >>> <[email protected]>wrote:
>
> >>>> had microsoft came in nit kurukshetra in last week????if yes then guys
> >>>> from nit kurukshetra plz tell there procedure n questions???thnx in
> >>>> advance guys
>
> >>>> --
> >>>> You received this message because you are subscribed to the Google
> >>>> Groups "Algorithm Geeks" group.
> >>>> To post to this group, send email to [email protected].
> >>>> To unsubscribe from this group, send email to
> >>>> [email protected].
> >>>> For more options, visit this group at
> >>>>http://groups.google.com/group/algogeeks?hl=en.
>
> >>> --
> >>> *Dheeraj Sharma*
> >>> Comp Engg.
> >>> NIT Kurukshetra
> >>> +91 8950264227
>
> >>> --
> >>> You received this message because you are subscribed to the Google Groups
> >>> "Algorithm Geeks" group.
> >>> To post to this group, send email to [email protected].
> >>> To unsubscribe from this group, send email to
> >>> [email protected].
> >>> For more options, visit this group at
> >>>http://groups.google.com/group/algogeeks?hl=en.
>
> >> --
>
> >> **Please do not print this e-mail until urgent requirement. Go Green!!
> >> Save Papers <=> Save Trees
> >> *BharatKumar Bagana*
> >> **http://www.google.com/profiles/bagana.bharatkumar<http://www.google.com/profiles/bagana.bharatkumar>
> >> *
> >> Mobile +91 8056127652*
> >> <[email protected]>
>
> >> --
> >> You received this message because you are subscribed to the Google Groups
> >> "Algorithm Geeks" group.
> >> To post to this group, send email to [email protected].
> >> To unsubscribe from this group, send email to
> >> [email protected].
> >> For more options, visit this group at
> >>http://groups.google.com/group/algogeeks?hl=en.
>
> > --
> > *Dheeraj Sharma*
> > Comp Engg.
> > NIT Kurukshetra
>
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to [email protected].
> > To unsubscribe from this group, send email to
> > [email protected].
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
