#includestdio.h
void print1();
void print2()
{
printf(Hello\n);
print1();
}
void print1()
{
printf(Hello\n);
print2();
}
int main()
{
print1();
}
On Thu, Mar 10, 2011 at 11:47 AM, nidhi jain nidhi.jain311...@gmail.comwrote:
@abhishek:isn't it recursion?
--
You
#includestdio.h
main()
{
long x;
float t;
scanf(%f,t);
printf(%d\n,t);
x=90;
printf(%f\n,x);
{
x=1;
printf(%f\n,x);
{
x=30;
printf(%f\n,x);
}
printf(%f\n,x);
}
x==9;
printf(%f\n,x);
}
use recursion.
On Tue, Mar 1, 2011 at 5:13 PM, bittu shashank7andr...@gmail.com wrote:
here we go
void main()
{
int i;
i=1;
loop:
printf(%d, i)
(i100)? i++: return 0;
go to loop;
}
Thanks Regards
Shashank Mani The Best Way to Escape From The Problem is to Solve
it
--
#includestdio.h
#includestdlib.h
int main()
{
int a[20],i,n,max,t,j,k;
printf(Enter the no. of elements\n);
scanf(%d,n);
for(i=0;in;i++)
scanf(%d,a[i]);
for(i=0;in-1;i++)
{
j=n-1;
max=0;
k=i;
while(ij)
{
...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
:-)
*
Nishant Agarwal
Computer Science and Engineering
NIT Allahabad
.
--
:-)
*
Nishant Agarwal
Computer Science and Engineering
NIT Allahabad
*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
.
--
:-)
*
Nishant Agarwal
Computer Science and Engineering
NIT Allahabad
*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
:-)
*
Nishant Agarwal
Computer Science and Engineering
NIT Allahabad
*
--
You received this message because you
options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
:-)
*
Nishant Agarwal
Computer Science and Engineering
NIT Allahabad
*
--
You received this message because you are subscribed
://groups.google.com/group/algogeeks?hl=en.
--
:-)
*
Nishant Agarwal
Computer Science and Engineering
NIT Allahabad
*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
:-)
*
Nishant Agarwal
Computer Science and Engineering
NIT Allahabad
.
--
:-)
*
Nishant Agarwal
Computer Science and Engineering
NIT Allahabad
*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com
.
--
:-)
*
Nishant Agarwal
Computer Science and Engineering
NIT Allahabad
*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from
));
gets(s);
xstrrev(s,0,strlen(s)-1);
puts(s);
return 0;
}
On Fri, Sep 24, 2010 at 12:15 AM, coolfrog$ dixit.coolfrog.div...@gmail.com
wrote:
@nishant:
what is i and j..???
@
On Thu, Sep 23, 2010 at 1:20 PM, Nishant Agarwal
nishant.agarwa...@gmail.com wrote:
void xstrrev(char
this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
:-)
*
Nishant Agarwal
Computer Science and Engineering
NIT
%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
:-)
*
Nishant Agarwal
Computer Science and Engineering
NIT Allahabad
*
--
You
options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
:-)
*
Nishant Agarwal
Computer Science and Engineering
NIT Allahabad
*
--
You received this message because you are subscribed
17 matches
Mail list logo
