...
--
--
--
*ATul Singh** Software Engineer**, Interra Systems*
Mobile : +91-9410826039
www.interrrasystems.com
[image: Facebook] http://www.facebook.com/atulsingh7890 [image:
Twitter]http://www.twitter.com/atulsng
[image: LinkedIn] http://www.linkedin.com/in/atulsingh7890
--
@Pralay.. can u give a more detail about non synced data structure
--
@biku look at the conditions
where x is equal to b
when a x b
suppose
1 5 5 , it should give FALSE ...
--
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
Yours can be used at the situation when
a x = b , Good one .,
--
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
i have attached a file consisting first by comparison and second by XORING
biku,.,. u shuld have a look at that..
--
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
srry for my wrong typo..
it should be
*
unsinged( x - a ) (unsigned)b - a*
works only for positive a and b 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
Is there a efficient way to check the range of numbers in C++
Suppose if x is to checked in range a and b both exclusive
ie if ( x a x b )
Is there any efficient way of doing this.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
be that returning recursive manner and filling that register is
dependent on compiler to compiler.
--
*ATul Singh** *
Mobile : +91-9410826039
[image: Facebook] http://www.facebook.com/atulsingh7890 [image:
Twitter]http://www.twitter.com/atulsng
[image: LinkedIn] http://www.linkedin.com
, .
-
ATul Singh | Computer Science Engineering| 2008-12 Batch | NIT Jalandhar
| 9530739855
--
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
These posts will clear ur questions
http://www.geeksforgeeks.org/archives/12367
http://www.geeksforgeeks.org/archives/12615
--
ATul Singh | Computer Science Engineering| 2008-12 Batch | NIT Jalandhar
| 9530739855
--
You received this message because you are subscribed to the Google Groups
I couldn't understand the meaning of *return the pointer to smallest*
Is it that that the pointer of largest node will point to smallest node.
ATul Singh | Final Year | Computer Science Engineering | NIT
Jalandhar | 9530739855
|
--
You received this message because you are subscribed
This was a MS question asked recently on Run length Decoding. I was
given
Input- a3b5c3d2
And the output should be ddcccbaaa
Assuming that the memory given is sufficient to accomodate the whole
string.
And this conversion should be inplace. ie the output string should not
use another array.
representation
then 6 has two sum sets as {1,2,3} or {1,5}
then the fibonacci number just less than 6 is 5 so bit representing 5 is
set then for completing the sum to 6 bit 1 is also set.
so *fibonacci representation of 6 is 1001 .* not 0111
ATul Singh | Final Year | Computer Science
1.You can use wget to get the homepage source.
2.Then u can grep the links in it and using cut to get the clear links
associated in that page.
3.Doing that recursively all links can be crawled.
--
ATul Singh | Final Year | Computer Science Engineering | NIT
Jalandhar | 9530739855
|
--
You
, and initialization
is done only once at compile time when memory is allocated for the static
variable
--
ATul Singh | Final Year | Computer Science Engineering | NIT
Jalandhar | 9530739855
|
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
://groups.google.com/group/algogeeks?hl=en.
--
ATul Singh | Final Year | Computer Science Engineering | NIT Jalandhar
--
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
16 matches
Mail list logo