is: 1,2,3,4
I divide it into 2 sets {1,4} and {2,3} such that the difference of their
sum (1+4=)5 - (2+3=)5 = 0
This is the least possible difference.
Pls help.
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because you are subscribed
sorry i meant =0 .. or are negative differences allowed ?
On Fri, Aug 14, 2009 at 7:02 PM, Ajinkya Kale kaleajin...@gmail.com wrote:
Should the difference be = 0 always ?
On Fri, Aug 14, 2009 at 6:57 PM, fundoonick fundoon...@yahoo.co.inwrote:
Problem:
I have a set of positive integers. I
use hashing.
On Wed, Jul 29, 2009 at 4:50 PM, Vijayasarathy K vijaykan@gmail.comwrote:
Consider an array of 'n' elements which contains all except 2 numbers
from 1(n + 2). How can we find the 2 missing elements?
--
Ciao,
Ajinkya
of an implentation of the spine tree decomposition
data structure.
It will be released (in Squeak at least) under the MIT license.
Thanks for any help provided.
Ralph Boland
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because you
,
Ajinkya
--~--~-~--~~~---~--~~
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
attached*
* *
* *
*Best Regards*
*Aminooo.com* http://www.aminooo.com
--
Thanks Regards
Vaibhav Jain
| Product Engineer, Technology @ Rediff.Com India Limited |
| E-mail :: vaibh...@rediff.co.in |
| Cell :: +91-97691 67938|
--
Ciao,
Ajinkya
,
Ajinkya
--~--~-~--~~~---~--~~
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
.
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
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
code a
|| tracks.never ever insult industry programmers..
On Thu, May 28, 2009 at 8:48 PM, Ajinkya Kale kaleajin...@gmail.comwrote:
Yeah .. I am a programmer too and industry coding sucks most of the
times..
You should not opt for real world programming at this age .. make your
basics
should try to solve some problems
fromhttp://www.spoj.pl/or acm.sgu.ru
Okay, but I'd like an idea of real-world programming and not just
trying to solve hard problems under timed conditions. Any ideas?
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received
and is something I can
go on with? Other than competing in USACO...
Thanks
Albert
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
,
Ajinkya
--~--~-~--~~~---~--~~
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
spiderc...@yahoo.co.uk
As per my previous post, is there anybody who can explain section 3 to
me from the PDF mentioned in this link:
http://groups.google.com/group/algogeeks/t/6ccc544529b01d10
Any help would be great.
A
--
Ciao,
Ajinkya
merge sort
T(n)=2T(n/2)+n=2(2T(n/4)+n/2 )+n=4T(n/4)+2n=4(2T(n/8)+n/4 )+2n=8T(n/8)+3n
there will be always only contains linear terms, however ...
2009/4/1 Ajinkya Kale kaleajin...@gmail.com
The intuitive proof maybe that if you try to expand the
recursion over a few steps
//ww.livejournal.com/users/arunachalam
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
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
, for that.i alsow see from first sight that
it is O(n^2), but i wane just fo verify that.
2009/4/1 Ajinkya Kale kaleajin...@gmail.com
I dont think you even need to solve the recursion ..
by looking at it it seems to be O(n^2) right ?
On Wed, Apr 1, 2009 at 2:18 PM, Miroslav Balaz
gpsla
/13 Ajinkya Kale kaleajin...@gmail.com
If i am not wrong there is a parameterized algorithm for this which is
in P
On Fri, Mar 13, 2009 at 3:40 AM, Miroslav Balaz
gpsla...@googlemail.com wrote:
Ok this is NP-comlete... so no fast algorithm is known
2009/3/12 Amina Maarouf
,
Ajinkya
--~--~-~--~~~---~--~~
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
to indicate to me ?
Sincerely,
Luciano Soares Pinheiro Jr.
Analista desenvolvedor Sr.
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
, and the second case shall hold.
Where did you get this question from, if I may ask?
On Sep 14, 10:00 pm, Ajinkya Kale [EMAIL PROTECTED] wrote:
Actually there is one more condition to it but i thought it will be more
complicated
to mention it,
at each step we subtract 2^(ceil(log n) if n
Sorry i forgot, it is ceil(log n) so n-2^( ceil(log n) ) is not equal to
zero..
On Sun, Sep 14, 2008 at 8:57 AM, Karthik Singaram Lakshmanan
[EMAIL PROTECTED] wrote:
Isn't n-2^logn = 0?
since 2^logn = n if you are talking about log base 2
--
Ciao,
Ajinkya
,
Ajinkya
--~--~-~--~~~---~--~~
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 [EMAIL PROTECTED]
For more options
Yup there are .
Refer horowitz sahani book on algorithms called fundamentals of algorithms
On Mon, Jun 23, 2008 at 4:36 PM, zee [EMAIL PROTECTED] wrote:
do we have an algo for finding the union of two sets ???
data structure suitable for set operations
--
Ciao,
Ajinkya
How do we solve recurrence relations of the form:
T(c) = T( | c - 2^ceil(log_2(c)) | ) + O( 2^ceil(log_2c) )
What will be the approximate outcome of this equation if not exact ?
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because you
)) | will be 0 if log is base 2. Obviously I
am missing something, could you throw some light on that expression?
On Wed, Jun 4, 2008 at 10:26 AM, Ajinkya Kale [EMAIL PROTECTED]
wrote:
How do we solve recurrence relations of the form:
T(c) = T( | c - 2^ceil(log_2(c)) | ) + O( 2^ceil(log_2c) )
What
significance of this?
Thanks,
Vinodh
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
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
because
someone in one subtree of that person married someone in anther
subtree many generations later.
Dave
On Jun 3, 10:48 am, Ajinkya Kale [EMAIL PROTECTED] wrote:
On Tue, Jun 3, 2008 at 1:35 PM, Dave [EMAIL PROTECTED] wrote:
The definition is recursive. The empty binary tree
. This happened because
someone in one subtree of that person married someone in anther
subtree many generations later.
Dave
On Jun 3, 10:48 am, Ajinkya Kale [EMAIL PROTECTED] wrote:
On Tue, Jun 3, 2008 at 1:35 PM, Dave [EMAIL PROTECTED] wrote:
The definition is recursive
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
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 [EMAIL PROTECTED]
For more
on the actual topology of the graph. It should be possible
to calculate an upper and lower bound, but for an accurate number for
a given graph I think you're stuck with counting them.
---
Geoff
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received
to this group, Can anyone of you please tell me wen will we
go for rotations in RedBlack Trees while inserting a new node apart
from recoloring.
Is there anyway to easily determine which Rotation to be used ? Right
or left ???
Regards,
Bindhiya
--
Ciao,
Ajinkya
with a
color is remained in the graph. Then use heuristic strategy for
salesman problem.
any other idea?
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
have tried it many times.but not getting it...can
anyone help me..
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
can choose while moving from A-K
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
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
,
Ajinkya
--~--~-~--~~~---~--~~
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 [EMAIL PROTECTED]
For more
Hey I am interested too...pls do let me know what do we have to do..
On 1/24/08, Albert Sanchez [EMAIL PROTECTED] wrote:
Hi,
Anyone interested in road traffic strategies? Flow optimization, time
dependent shortest paths problems?
Albert
--
Ciao,
Ajinkya
suggest something?
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
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
these numbers?? I
mean I understand it's a O(n^2) sort, but how do you approximate time
taken??
Thanks in advance.
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
keep them
untouched. Do in ONE PASS without taking extra memory.(modify array in
place)
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
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 [EMAIL PROTECTED
by adding every possible
pair.
The task is to find the n integers given the set of sums.
Any ideas?
I've found out the solution but I doubt it the best one...
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because you
.
Any ideas?
I've found out the solution but I doubt it the best one...
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
of
any till now.
=
Thanks
Allysson
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
is (0,0) ie origin then coordinate of 11
will
be (2,0) and so on .
now my problem is if i give coordiante (2,-1) then my program should
return 12 .
thnkx in advance
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because
a explanation how I get the equation below true?
Why lg(n-2i) became lg(2i)?
Thanks in advance.
Allysson
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
--
Ciao,
Ajinkya
--~--~-~--~~~---~--~~
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 [EMAIL PROTECTED
This is a good group discussing programming problems and algorithms to
solve programming problems.
http://groups.google.com/group/programming-challenges
Check it out !
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google
+ 3 + 0
2 + 2 + 3 - 3 - 1 + 2 + 3 + 3 +
1 - 3 + 2 - 1 + 0
2 + 2 - 1 - 1 + 1 + 3 + 3 + 2 - 2 -
4 - 4 + 2 + 2 + 1 - 1 - 2 +
1 + 1 - 1 + 7 + 2 - 1 + 0
Output
9
16
27
--
PRADEEP MACHARLA
Ph:08040141194
--
Ciao,
Ajinkya
48 matches
Mail list logo
