i hope now it clear:
[image: Screenshot.png]
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.
main()
{
int a=10,20;
a^=b^=a^=b;
printf("%d\n %d\n",a,b);
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr.
lol
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group
funct(char* str)
{
printf("%s\n",str);
}
main()
{
static int ii = 1;
int jj = 5;
ii+=++jj;
funct(ii+++"Campus Interview");
}
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email
#include
#define FUNC1(i) (i*(i-1))
#define FUNC2(i) (i==0?1:i*FUNC1(i-1))
main()
{
int i=8;
printf("\n%d",FUNC2(i));
}
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegro
#include
#define FUNC1(i) (i*(i-1))
#define FUNC2(i) (i==0?1:i*FUNC1(i-1))
main()
{
int i=8;
printf("\n%d",FUNC2(i));
}
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegro
2)
int main()
{
fork();
fork();
fork();
fork()
printf("Hello world!");
}
a.out─┬─a.out─┬─a.out─┬─a.out───a.out
│ │ └─a.out
│ ├─a.out───a.out
│ └─a.out
e g: scanf("%2.4d",&a);
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options,
int divideby3 (int num)
{
int sum = 0;
while (num > 3) {
sum += num >> 2;
num = (num >> 2) + (num & 3);
}
if (num == 3) ++sum;
return sum;
}
Thanks & Regards...*
รυ∂んเя мเรんяค*
--
You received this message because you are subscribed to the Google Groups
"Algor
---
Sudhir mishra wants to stay in better touch using some of Google's coolest new
products.
If you already have Gmail or Google Talk, visit:
http://mail.google.com/mail/b-62d5befb93-80d907c33d-qc8z-Uscge2hvBwQ28GKNjP8hvc
Y
give some explanation
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, vi
sudhir08.mis...@gmail.com
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options
++
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
now post
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this grou
why
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
give soon
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this gro
** Make NECESSARY assumptions.
.Kingdom of *Maplewood* is a beautiful country comprising of a lot of small
islands of different areas. All the islands are in a straight row. King *
Rosewood* is getting old and has decided to divide the islands among his two
sons - *Eric* and *Finn*. Luckily, th
ons, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
[image: motilal.JPG]
Thanks & Regards...*
SUDHIR MISHRA *
*IT 3rd YEAR*
*Motilal Nehru National institute Of Technology-ALLAHABAD.
*
--
You received this message because you are subscribed to the Google
Ques: What is Abstract Classes?
Ques:What is interfaces?
Ques:What is difference between abstract classes and interfaces?
Ques:Give an example where do you use interfaces and abstract classes?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
T
virtual memory allows us to run processes of size more than RAM. Is there
any other use of virtual memory?
can ever achieve greatly.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.c
Is it possible to implement
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more optio
in net search infinite symbole and copy it---
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@google
what is rmq
On Fri, Mar 4, 2011 at 7:21 AM, Vipin Agrawal wrote:
> There are many way to find out least common ancestor.
> Best Solution is RMQ.
>
> On Mar 4, 3:59 pm, Sudhir mishra wrote:
> > binary tree, nodes, each node has an ID
> >
> > root node of t
submit only
main(){
printf("∞");
}
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For mor
: node
id of this ancestor node
--
*
*
Thanks & Regards...*
SUDHIR MISHRA *
*IT 3rd YEAR*
*Motilal Nehru National institute Of Technology-ALLAHABAD.
*
--
You received this message because you are subscribed to
please explain what is trie
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more optio
best way , Memory-wise, to store 10 Crores mobile numbers ?
this is an interview question of Google.its a bit too easy.
--
*
*
Thanks & Regards...*
*Sudhir Mishra
*IT 3rd YEAR*
*Motilal Nehru National institut
nice solution
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more opt
---
SUDHIR MISHRA wants to stay in better touch using some of Google's coolest new
products.
If you already have Gmail or Google Talk, visit:
http://mail.google.com/mail/b-62d5befb93-3fceb99bf3-oYX-pec-NCYCzMLIBV7yRJ6EMUI
Y
---
SUDHIR MISHRA wants to stay in better touch using some of Google's coolest new
products.
If you already have Gmail or Google Talk, visit:
http://mail.google.com/mail/b-62d5befb93-a1202cc5cd-5oEiMcLpaEPVY-UR9eGSSYdrezQ
Y
o k---thanks mittal
--
Thanks & Regards...*
*Sudhir Mishra
*IT 3rd YEAR*
*Motilal Nehru National institute Of Technology-ALLAHABAD.
*
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send emai
help to install-
Fedora O S by 4 gb pendrive
--
Thanks & Regards...*
*Sudhir Mishra
*IT 3rd YEAR*
*Motilal Nehru National institute Of Technology-ALLAHABAD.
*
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
T
sugest study material for gate 2011
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For mo
thank u,wish u the same
--
*
Thanks & Regards...
Sudhir Mishra
undergraduate student,
Department Of **Computer Science and engineering,*
*Motilal Nehru National institute Of Technology-ALLAHABAD.
*
--
You received this message because you are subscribed to the Google Groups
"Algori
---
sudhir mishra wants to stay in better touch using some of Google's coolest new
products.
If you already have Gmail or Google Talk, visit:
http://mail.google.com/mail/b-62d5befb93-c4270e4073-gZW-XtMwbOw3w3XU9CHGZ6uR5ZQ
Y
**https://www.spoj.pl/problems/MCARDS/en/
--
--
regards
*Sudhir Mishra*
MNNIT 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 this g
if ( i%2 ) *return (++i);*
else return fun(fun( i - 1 ));
}
int main()
{
printf(" %d ", fun(200));
getchar();
return 0;
}
--
--
regards
*Sudhir Mishra*
MNNIT ALLAHABAD
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" grou
Write a program to swap odd and even bits in an unsigned integer with as few
instructions as possible (e.g., bit 0 and bit 1 are swapped, bit 2 and bit 3
are swapped, etc).
eg[?]
input---
1234567
7654321
888
output--
411
12109682
948
--
regards
*Sudhir Mishra*
MNNIT ALLAHABAD
c implementationpath in pyramid
we come botom to up -
eg:store like it(_we go ether right or down))
1
1 2
1 2 3
=>
step 2) 6
step 1) 3 5
1 2 3
--->
#include
int a[100][100];
void solve(int m)
{
int t1,t2,j1;
if(m==-1)
printf("%d\n",a[
39 matches
Mail list logo
