*int main()
{
char *p = ayqm;
printf(%c,++*(p++));
return 0;
}*
--
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
can somebody provide the link or explain how malloc is implemented
internally as googling didn't help me.
--
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
convert bst to doubly linked list inorder and find middle element using slow
and fast pointer concept
On Tue, Sep 27, 2011 at 2:18 PM, Ankur Garg ankurga...@gmail.com wrote:
I was thinking of making the tree balanced with equal no of nodes in left
and right subtree
Median will be
clock period=(slowest stage delay)+(Buffer delay).
slowest stage delay is 160 ns and Buffer delay is 5ns. Buffer delay will
always be there between two stages .
clock period=165ns.
In the pipelining the time it takes =(k+n-1) * (clock period)
k=number of stages and n=number of
congrats dude
On Thu, Sep 22, 2011 at 10:51 PM, sukran dhawan sukrandha...@gmail.comwrote:
congrats
On Thu, Sep 22, 2011 at 10:33 PM, Prakash D cegprak...@gmail.com wrote:
congrats brother!!
On Thu, Sep 22, 2011 at 6:42 PM, saurabh sah.saurab...@gmail.com wrote:
thanx to
*max=(ab)*a+(ba)*b;*
On Wed, Aug 24, 2011 at 7:32 PM, vikas singh shyguy1...@gmail.com wrote:
On Tue, Aug 23, 2011 at 7:50 PM, *$* gopi.komand...@gmail.com wrote:
int a,b;
int c=a-b;
c=c31;
c=c31; // hope you're trying for this. ;)
int x =c0x01;
a=a-x*c;
Thx,
--Gopi
On Tue,
thanks...:)
On Thu, Jul 28, 2011 at 5:54 PM, Rahul Menon menonrahul1...@gmail.comwrote:
Hello friends,
Recently I appeared for placement interviews for Amazon in my
campus.Unfortunately though I couldn't make it, still want to share
something for others here preparing for amazon
int main()
{
buildsubsets(0,0,);
}
void buildsubsets(int i,int j,String subset)
{
if(j==k)
{
coutsubset+ ;
return ;
}
for(;in;++i)
buildsubsets(i+1,j+1,subset+arr[i]);
}
assume that given arr[] is a character array i.e.
check this link:
*http://www.stefan-pochmann.info/spots/tutorials/sets_subsets/*
On Tue, Jul 26, 2011 at 11:59 AM, sumit sumitispar...@gmail.com wrote:
Given an array of size n, print all the possible subset of array of
size k.
eg:-
input:
a[]={1,2,3,4}, k = 2
output:
1,2
1,3
1,4
2,3
nice one
On Mon, Jul 25, 2011 at 9:53 PM, dilip makwana dilipmakwa...@gmail.comwrote:
@Rajeev
Excellent link ...
--
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
10 matches
Mail list logo
