thm 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
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Re
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
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
ogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Regards
Siddharth Srivastava
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post t
il to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
You received this message beca
ions, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
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
e 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
> http://groups.google.com/group/algoge
ot; 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
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Regards
Si
eeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
You received this message because you are s
scribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
You received this message because you are subscribed to the Google Groups
&qu
ks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Regards
Siddharth Srivastava
--
You received this message because you
; 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 op
; 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,
ssage 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.c
/-/QBiQoXPIk78J.
>
> 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
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Sid
oup, 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
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
You receiv
; algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to
oups
> "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
> http://groups.google.com/group/algogeeks?hl=e
eks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this gr
roups
> "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
> http://groups.google.com/group/algogeek
ot;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
> http://groups.google.com/group/algogeeks?hl=en.
&
; http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
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, se
t;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
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
is 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
om.
>>>> To unsubscribe from this group, send email to
>>>> algogeeks+unsubscr...@googlegroups.com.
>>>> For more options, visit this group at
>>>> http://groups.google.com/group/algogeeks?hl=en.
>>>>
>>>
>>> --
>>>
lgogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post
groups.com
>>>>>>>>> .
>>>>>>>>> For more options, visit this group at
>>>>>>>>> http://groups.google.com/**group/algogeeks?hl=en<http://groups.google.com/group/algogeeks?hl=en>
>>>>>>>&g
send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> 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&q
oogle.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 algogeeks@googlegroups.com.
>> To unsubscrib
On 15 August 2011 00:15, sukran dhawan wrote:
> do they recruit software engineers for maintainenance?
yes..and major chunk of projects are maintenance only
>
>
> On Mon, Aug 15, 2011 at 12:10 AM, siddharth srivastava <
> akssps...@gmail.com> wrote:
>
>>
>>
ou 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
> http://group
t; **Regards
>>> SAGAR PAREEK
>>> COMPUTER SCIENCE AND ENGINEERING
>>> NIT ALLAHABAD
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to
send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks
>
>
> On Tue, Aug 9, 2011 at 6:32 PM, siddharth srivastava
> wrote:
>
>> @sidharth: thanks a lot for correcting me :)
>>> @aditya : no. there was some mistake;
>>>
>>> in the code i pasted above it's giving segmentation fault. Is it cause
>
il to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>>
>
>
> --
> regards Pratima :)
>
> --
> You received this message because you are subscribed to the Goog
my bad..that I didn't notice = (assumed it to be ==)
On 9 August 2011 22:28, SANDEEP CHUGH wrote:
> it doesn't matter
>
> On Tue, Aug 9, 2011 at 10:25 PM, siddharth srivastava > wrote:
>
>>
>>
>> On 9 August 2011 22:20, tech rascal wrote:
>&
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 algogeeks@googlegroups
scr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send
eceived 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, v
oogle.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
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
a
sage 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
eeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group
p://groups.google.com/group/algogeeks?hl=en.
>
>
--
Regards
Siddharth Srivastava
--
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 t
+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Regards
Siddharth Srivastava
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to th
geeks+unsubscr...@googlegroups.com.
>>> 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&quo
& Communication Divison
> NETAJI SUBHAS INSTITUTE OF TECHNOLOGY
> Sector 3, Dwarka
> New Delhi
>
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googl
.
> 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
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Sriv
; 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
On 6 August 2011 21:50, siddharth srivastava wrote:
> Hi
>
> On 6 August 2011 20:20, SANDEEP CHUGH wrote:
>
>> padding wud be between int & char..(for ur last case)
>>
>> now u said if it starts at 4 , still the block will be 8 (size of double),
>> that i
m??
>
>
>
>
>
>
> On Sat, Aug 6, 2011 at 8:06 PM, siddharth srivastava
> wrote:
>
>> but if the reference is not 0 .. if it wud have been 4 then for tht case
>>> tell me do we really need that 7 bytes??
>>>
>>
>> yes, because in any ca
ompiler nt doing padding at all in
> turbo c..
>
> On Sat, Aug 6, 2011 at 7:50 PM, siddharth srivastava
> wrote:
>
>> Hi Sandeep
>>
>> On 6 August 2011 19:16, SANDEEP CHUGH wrote:
>>
>>> take this case
>>>
>>> str
e from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
You received this message because you are subscribed to the Google Groups
&q
ups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards
Siddharth Srivastava
--
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
Unexpected but most of us have quoted the spam in our replies :-)
Well, I guess the moderator is reading and would take an action soon
--
Regards
Siddharth Srivastava
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to
@rahul, juver++,sankalp
Though this can be solved using incrementing the range in sieve. But due to
this incremental approach how much the efficiency can be improved, any
guesses :)
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to
ge is given, but what to do in this case.
> Dave
>
> On Jan 25, 6:00 am, siddharth srivastava wrote:
> > Hi
> >
> > Its an easy one but still I am looking for the most efficient approach.
> >
> > Find first 1 million prime numbers.
> >
> > --
&
this link: http://geeksforgeeks.org/?p=4034
>
> Thanks,
> Balaji.
>
> On Tue, Jan 25, 2011 at 9:35 AM, siddharth srivastava > wrote:
>
>> Hi
>>
>> On 24 January 2011 12:55, Balaji Ramani wrote:
>>
>>> @Siddharth
>>>
>>> However if the input rang
Hi
Its an easy one but still I am looking for the most efficient approach.
Find first 1 million prime numbers.
--
Siddharth Srivastava
When you have learned to snatch the error code from the trap frame, it will
be time for you to leave.
--
You received this message because you are
O(n) = O(nlogn)
>
yes I meant this case only. But to what value would you compare if you want
the sum to be closest to zero and lets say that none of the elements sum up
to zero.
>
> Thanks,
> Balaji.
>
>
> On Mon, Jan 24, 2011 at 11:03 PM, siddharth srivastava <
> ak
quot;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
> http://groups.google.com/group/algogeeks?hl=en.
&
group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Siddharth Srivastava
Wh
);
> }
>
> For the explanation/justification, see
> http://groups.google.com/group/programming-puzzles/msg/3a05b3c8b4042d5b.
>
Thanks a lot Dave
> Dave
>
> On Nov 16, 12:18 pm, siddharth srivastava wrote:
>> Input a number and then find the next higher number
>> such that for b
Input a number and then find the next higher number
such that for both the number (inputted and the next higher
number)
in binary representation contains equal number os ones.
Example:
Input:3(0011)
Ouput:5(0101)
--
Siddharth Srivastava
When you have learned to snatch
rintf("\n");
> ChuteStats();
> printf("\n");
>
> ++game;
> printf("\n\n Would you like to run the simulation again?
> (1=Yes)...");
> scanf("%i",&reply);
> if(reply==1)//e.g. reply==1
>
eeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Siddharth Srivastava
When you have learned to snatch the error code from the trap frame, it will
be time for you to leave.
--
You received this message becau
erted to latitiude/longitude difference easily
> by this ratio.
>
would it change then ?
>
>
> On Jul 15, 12:59 pm, siddharth srivastava wrote:
> > Hi
> >
> > If I have a (latitude, langitude) as well as pixel positions of those
> > locations, then how can (l
Hi
If I have a (latitude, langitude) as well as pixel positions of those
locations, then how can (longitude, latitude) or pixel coordinates of a
point x metres away can be found ?
If this information is not enough, what else information might be required ?
--
Siddharth Srivastava
When you
s group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Siddharth Srivastava
When you have learned to snatch the error code from the trap frame, it will
be time for you to leave.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Gee
om this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Siddharth Srivastava
When you have learned to snatch the error code from the trap frame, it will
be time for you t
coordinates of the point on the screen
border in the direction of movement ?
Ultimate aim is to calculate the time required to reach the border if the
object is assumed to be moving in the direction at that instant.
--
Siddharth Srivastava
When you have learned to snatch the error code from the
_shift;
else
y_border = y_center + y_shift;
//x_shift and y_shift are constants.
What is the best possible way to determine in which quadrant( wrt to the
center) the point (x,y) lies ?
Siddharth Srivastava
--
You received this message because you are subscribed to the Google
cribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com
>>> .
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>>
>>
>>
>> --
>> There are two kinds
Can anyone help out in implementing Rabin Karp Algorithm ?
Thanks
--
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 group, send email to
algogeeks+unsub
Can anyone explain (or provide relevant link) of how a non complete
binary tree cannot correspond to an optimal prefix code ?
Do we have to give some sort of contradictory proof ?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to thi
73 matches
Mail list logo
