look at suffix trees, if you havent already done so.
On Sep 3, 1:24 am, ankur aggarwal ankur.mast@gmail.com wrote:
@all
i think bst wid little bit adjustment will work ..
any arguement ?
plz come up..
2009/8/30 Jayram Déshpandé jayde...@gmail.com
Shiyam's approach sounds like a
On Aug 27, 5:19 am, ankur aggarwal ankur.mast@gmail.com wrote:
Implement the birthday diary calendar to keep records of all birthdays of
your friends
1) what underlying data structure(s) you will use so that the memory
consumption should be optimum [i.e if you have only 12 birthday
LOL
Ouch
On Sat, Sep 5, 2009 at 10:35 AM, Geoffrey Summerhayes sumr...@gmail.comwrote:
On Aug 27, 5:19 am, ankur aggarwal ankur.mast@gmail.com wrote:
Implement the birthday diary calendar to keep records of all birthdays
of
your friends
1) what underlying data structure(s) you
Shiyam's approach sounds like a typical radix tree implementation e.g. Radix
tree based routing in networking.
that's a good solution for a very big data set and where we do'nt want to
store non-used data portions.
On Fri, Aug 28, 2009 at 6:42 PM, Shyam shyamheartbreak...@gmail.com wrote:
I
@shyam
hmm
gud try..
--~--~-~--~~~---~--~~
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 think a linked list structure should suffice for this. Since
insertions/deletions will not be too frequent. Memory consumption will also
be optimum.
On Thu, Aug 27, 2009 at 2:49 PM, ankur aggarwal ankur.mast@gmail.comwrote:
Implement the birthday diary calendar to keep records of all
@all
i m thinking of BST whose node structure is (year,month,date)
a node n1 node n2 if (year1 year2)
or (if year1==year2 month1 month2)
or (if year1==year2 month1 =month2 date 1 date2)
like partial order set ...
we can have AVL tree / threaded binary three (to get successor / predessor )
How about a hash?
On Fri, Aug 28, 2009 at 10:43 AM, Chonku cho...@gmail.com wrote:
I think a linked list structure should suffice for this. Since
insertions/deletions will not be too frequent. Memory consumption will also
be optimum.
On Thu, Aug 27, 2009 at 2:49 PM, ankur aggarwal
I think we can have a BST that is keyed based on birth day date and
month this is done as follows.. If i have a birth day on Jan 2 nd then
key value is 2(2nd day of the year) if birthday is feb 14th then its 45
(31+14).The tree nodes can have a count of number of people whose
b'days are on that
@sandeep ..
tell us your hash function ..
and other possible func..
--~--~-~--~~~---~--~~
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
