subscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
d email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
ups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
9986978008
9845543101
E-Mail : [EMAIL PROTECTED]
[EMAIL PROTECTED]
--~--~-~--~~~---~--~~
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
9986978008
9845543101
E-Mail : [EMAIL PROTECTED]
[EMAIL PROTECTED]
--~--~-~--~~~---~--~~
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
isn't it an application of association rule mining.
http://en.wikipedia.org/wiki/Association_rule
just that ARM will mostly result multiple solution depending on your
data. Its up to you to decide a strategy for breaking ties.
On Aug 15, 1:19 am, Geoffrey Summerhayes <[EMAIL PROTECTED
from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
Regular expressions ?
--~--~-~--~~~---~--~~
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
It doesn't matter ...
On May 15, 4:19 pm, Vinodh <[EMAIL PROTECTED]> wrote:
> On any algorithm book they often specify the speed of the algorithm.
> I often see many algorithms having speed factor O(nlogn).
>
> **Is it log base 2 n ? Or Is it log base 10 n?
il to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
Any chance I could get a copy of that as well? :)
On Mar 21, 3:49 am, Ashesh <[EMAIL PROTECTED]> wrote:
> Done.
>
> On Mar 20, 4:45 pm, VRC <[EMAIL PROTECTED]> wrote:
>
> > I am also interested to know about the solution? Would you please
> > email me? Tha
yanto" <[EMAIL PROTECTED]> wrote:
> If the BST is balance, you could do it better in O(lg n). I believe
> some setup should be involved, such as storing how many nodes in a
> subtree.
>
> Best,
> -Lego
>
> On 2/28/08, Dave <[EMAIL PROTECTED]> wrote:
>
>
gle 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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
his group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
Please ignore this message. This is supposed to be e reply of some
other message.
On Feb 11, 10:47 am, "[EMAIL PROTECTED]" <[EMAIL PROTECTED]>
wrote:
> Thanks for all the effort. Sorry, I should have mentioned it earlier.
> But, we are asked to do it without modifying
Thanks for all the effort. Sorry, I should have mentioned it earlier.
But, we are asked to do it without modifying the tree in any manner
and using no more than a constant space outside the tree.
On Feb 11, 8:17 am, "phani bandaru" <[EMAIL PROTECTED]> wrote:
> Use inorde
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
oup.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
GOOD ONE->
Data Structures , Algorithms and Applications in C++ by Sartaj Sahani
On Feb 7, 1:58 pm, "Atul Aggarwal" <[EMAIL PROTECTED]> wrote:
> Hello Everybody,
>
> I am beginner in Algorithms. Which book I should prefer for understanding
> basic algos? Also t
Hi
I need to find x that will minimize Ax-b=0, under the inequality
constraints Cxhttp://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
GOT LIVE�� PROJECTS ON ASP.NET
�� ALONG WITH PLACEMENT GUIDANCE FOR FINAL YEAR CANDIDATES.
CONTACT:
RAYLOGIX TECHNOLOGIES
#737,2nd FLOOR DR. RAJ ROAD
RAJAJINAGAR 6TH BLOCK
BANGALORE-560010
Ravi.S.M: 9845311916
E-mail :- [EMAIL PROTECTED]
OFFICE: (080)-41731643/44
WEBSITE: www.raylogix.com
"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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
rithm 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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
FOR ECE
CANDIDATES.
WE GOT MORE THEN 20 LIVE�� PROJECTS ON ASP.NET
�� ALONG WITH PLACEMENT GUIDANCE FOR FINAL YEAR CANDIDATES.
CONTACT:
RAYLOGIX TECHNOLOGIES
#737,2nd FLOOR DR. RAJ ROAD
RAJAJINAGAR 6TH BLOCK
BANGALORE-560010
Ravi.S.M: 9845311916
E-mail :- [EMAIL PROTECTED]
OFFICE: (080
might be more
than increase in A. This means that |E| bound on the number of
iterations is not accurate. if so, what is the criteria for exiting
this algorithm.
Thanks,
Naveen
On Oct 28, 9:46 pm, Gene <[EMAIL PROTECTED]> wrote:
> On Oct 28, 2:02 pm, "[EMAIL PROTECTED]"
&g
them.
This is not so easy to implement, but really gives a good running
time which is O(nlogn)
On Oct 21, 9:21 am, "[EMAIL PROTECTED]" <[EMAIL PROTECTED]> wrote:
> Q) You are given a root-less tree (which can also be thought of as an
> undirected acyclic connected gra
into this tree, this would possiblly cause the
two endpoints violate the coloring. So we could just add one color,
then it is OK.
So, 3 color is good.
On Oct 21, 9:29 pm, "[EMAIL PROTECTED]"
<[EMAIL PROTECTED]> wrote:
> Hi,
>
>Can some provide me hint or solution
back to impact the input.
On Oct 23, 9:46 pm, Sticker <[EMAIL PROTECTED]> wrote:
> I used to come across some algorithms whose running time is related to
> the size of output. One kind of such algorithms is the pattern mining
> algorithms in Data Mining area. For these algorithms, h
port
Contact us:
Raylogix Technologies,
No. 737, Dr Raj Road, Rajajinagar 6th Block, Bangalore - 560 010
Phone: 080-41731641/42 & 09845311916 (Service 24/7)
[EMAIL PROTECTED]
www.raylogix.com
--~--~-~--~~~---~--~~
You received this message because you are subscribe
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
--~~
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
~
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
turn any one of them.
--~--~-~--~~~---~--~~
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 opt
ived 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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
t are
multiplied?
Thanks!
--~--~-~--~~~---~--~~
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 [
cross all the boxes.
reto
On Oct 16, 7:34 am, adak <[EMAIL PROTECTED]> wrote:
> Obviously there is no need for the one line of code that deals with
> minimizing /maximizing player's moves, in this case.
>
> A/B would still prune, but it would only prune out the piece
> arrangem
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
The only algorithm I'm aware of is :
digitsum(N,base) :
sum = 0
while N != 0
sum = N % base
N = N / base
return sum
which obviously isn't efficient.
On Sep 26, 2:12 am, Mgccl <[EMAIL PROTECTED]> wrote:
> is there a known, efficient digit sum algorithm
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
whoops, misunderstood the problem - I thought you meant the sum to the
end of the sequence minus the sum to the end. My bad. Please ignore
what I wrote above!
On 6 Sep, 01:21, "[EMAIL PROTECTED]" <[EMAIL PROTECTED]>
wrote:
> I know you've solved the problem, but I'
list every subsequence where j>f.
How does this look? Kinda new at this, so feedback is appreciated.
On 4 Sep, 03:33, Sticker <[EMAIL PROTECTED]> wrote:
> I have a problem on sequences of numbers:
>
> Given a sequence of integer numbers (could be quite long, let say, 10s
> of
hanks!
--~--~-~--~~~---~--~~
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, visit this group at http://gr
> 7 -> 5 -> 9 -> 6 -> 8 -> 7
> 8 -> 7 -> 5 -> 9 -> 6 -> 8
> 9 -> 6 -> 8 -> 7 -> 5 -> 9
> 10 -> 3 -> 1 -> 4 -> 2 -> 1
>
> On Aug 16, 1:41 pm, dsha <[EMAIL PROTECTED]> wrote:
>
>
>
> > Hi there,
>
>
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
7754
--~--~-~--~~~---~--~~
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, visit this
I have a regexp which looks like:
^94530|94540|a very long list of zip codes separated by ||
94397$
I want to reduce the regexp length. How can I do that? TIA.
On Jul 31, 5:58 pm, dor <[EMAIL PROTECTED]> wrote:
> On Jul 23, 10:29 am, "[EMAIL PROTECTED]" <[E
:58 pm, dor <[EMAIL PROTECTED]> wrote:
> On Jul 23, 10:29 am, "[EMAIL PROTECTED]" <[EMAIL PROTECTED]> wrote:
>
> > I have a list of zip codes (300) and I want to compress it so that my
> > regexp is concise. Can someone give me some pointers please? TIA.
&
7754
--~--~-~--~~~---~--~~
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 optio
I am sorry I was not clear. My regexp is currently like:
^94530|93540|..list of zip codes that is 400 - 500 in size that
ends like this..30329$
How do I go about making this concise.? Thank you.
On Jul 31, 5:58 pm, dor <[EMAIL PROTECTED]> wrote:
> On Jul 23, 10:29 am, "[E
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
test
--~--~-~--~~~---~--~~
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
the reverse of "hello world" is "dlrow olleh" and not "world hello"
Reversing chars is different from reversing words. In any case nobody
is going to help you with your homework. So before asking for any
concrete help post your trials...
On Jun 16, 10:13 am, M
again
solved by
two simultaneous equations
On Jun 1, 6:01 pm, Terry <[EMAIL PROTECTED]> wrote:
> Hi,
> This one's puzzling me since a while. Any thoughts
> In a triangle ABC, find a point P such that perimeter of the triangles
> formed by (A,B,P), (B,C,P) and (A,C,P) are same.
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
In 3D, we can test |(p2-p1)*(p3-p1)|==0, where p1,p2 and p3 are
vectors.
On 5月27日, 上午7时22分, Feng <[EMAIL PROTECTED]> wrote:
> Hi all!
>
> Given 3 points in 3D, what is the fast and numerically stable way to
> test if they form a triangle?
>
> I am thinking computing the d
yes, you are right.
On 5月21日, 下午1时56分, Ray <[EMAIL PROTECTED]> wrote:
> Hi WangLei,
>
> The approach you provide is to compute the angle of every point
> pair, i != j.
> e.g. the angles are stored in an array. And then find the maxium
> identical elements
> of the
roups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
the whole problem is O(n^2*ln(n)) .
On 5月14日, 下午10时06分, Balachander <[EMAIL PROTECTED]> wrote:
> Hey..
>
> How can reduce the Comp from O(n) to O(log n)
> How are arranging the lines [ nC2 lines]
> for the purpose of finding the max no of collinear points
>
> For fin
I have a brute force solution with the time complexity of
O(n^2ln(n))...
how can we impove it?
On 5月14日, 下午6时50分, PopUp <[EMAIL PROTECTED]> wrote:
> I have brute force solution, this was asked in Google Interview.
>
> On May 14, 1:36 pm, "Cool Guy" <[EMAIL PROTECTE
I wrote the below code and tested with n =2 and n=3.
The idea is given a position (i,j) queen has three possibilities (i,j
+1),(i+1,,j+1) (i+1,,j) (Off Course not always since bounds needs to
be checked)
int numOfPath = 0;
int n = 3;
void FollowPath(int i,int j)
{
if (i >= n || j >=n)
{
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
groups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
groups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
plain text only. No attachments, hypertext, or
active content. Please include the word "Mathematician" in e-mail
subject line. Please send to:
John F. McGowan, Ph.D.
President, Research and Development Division
GFT Group Inc.
[EMAIL PROTECTED]
--~--~-~--~~~
hm 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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
RR* = R* iff R containts epsilon (empty string).
On Mar 27, 1:00 pm, "Shashi Kant" <[EMAIL PROTECTED]> wrote:
> which book ??
>
> On 3/27/07, Dhruva Sagar <[EMAIL PROTECTED]> wrote:
>
>
>
> > But it is used in books about automata...I am n
this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
d email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
On Mar 21, 7:40 am, "hijkl" <[EMAIL PROTECTED]> wrote:
> . How to reverse all the bits in a unsigned integer? an signed
> integer (you have to keep the sign of the integer)?
For an unsigned int, the following algorithm can be used (I believe
you can find in in the &quo
roup, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
line.us
Ajay Sharma
--~--~-~--~~~---~--~~
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 PROT
the task?
Thanks.
--~--~-~--~~~---~--~~
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 PROTEC
Thanks! Solved it now.
On Feb 12, 4:20 am, "Lego Haryanto" <[EMAIL PROTECTED]> wrote:
> Can be solved by dynamic programming. It can scale also even when we expand
> this and introduce the 5, 6, or more coefficients.
>
> Think of small stuff first. We know immedi
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, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
d email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups-beta.google.com/group/algogeeks
-~--~~~~--~~--~--~---
ok, this is a lame attempt - can someone explain if it's correct, or
why not :
int limited_rand() {
return rand() % 8 + 1;
}
value = limited_rand() % 3 + limited_rand();
On Jan 31, 7:29 am, "Ming \(Amos\) Zhang" <[EMAIL PROTECTED]> wrote:
> It's not unifo
ups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups-beta.google.com/group/algogeeks
-~--~~~~--~~--~--~---
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, visit this group at
http://groups-beta.google
nsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups-beta.google.com/group/algogeeks
-~--~~~~--~~--~--~---
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, visit this group at
http://groups-beta.google.com/group/algogeeks
-~--~~~~--~~--~--~---
ithm
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, visit this group at
http://groups-beta.google.com/group/algogeeks
-~--~~~~--~~--~--~---
first put f to the temp=k-th position,than put to the temp=k*2
position..
when temp=k*n>x+y,make temp=temp-(x+y)
until y times
right?
i am not good at English,sorry.
On 12月8日, 下午2时23分, "Darth" <[EMAIL PROTECTED]> wrote:
> Hi,
>
> I think this is a standard proble
execution?
--~--~-~--~~~---~--~~
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
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 group, send email to [EMAIL PROTE
the
algortihm, but I'm really to stupid to get the reason - anyone can 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 algogee
this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups-beta.google.com/group/algogeeks
-~--~~~~--~~--~--~---
==
thank you very much!
--~--~-~--~~~---~--~~
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]
"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, visit this group at
http://groups-beta.google.com/group/algogeeks
-~--~~~~--~~--~--~---
"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, visit this group at
http://groups-beta.google.com/group/algogeeks
-~--~~~~--~~--~--~---
d or in
Tail it will occurs more than n/2m times.
So we can divide and conquer it recursively.
And for even case, it will be similar.
On Nov 2, 10:21 am, "ericunfuk" <[EMAIL PROTECTED]> wrote:
> Dear all,
>
> I have worked out the following algorithm for finding the ma
paring the orders of each lists("String" in former post is a type
error).
I will put my program tomorrow in my time, as now I am kinda busy.
On Nov 2, 5:17 pm, Arun <[EMAIL PROTECTED]> wrote:
> > In fact, if two lists have identical elements, they have identical BSTsets.
>
order comparison between two strings.
And it can be handled in O(N).
On Nov 1, 2:23 pm, "Vijendra Singh" <[EMAIL PROTECTED]> wrote:
> Oh ok.. I got confused... lemme think about this one. I think it has a
> recursive soltuion but will confirm it.
>
> -Vijju
>
> On
eks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups-beta.google.com/group/algogeeks
-~--~~~~--~~--~--~---
1 - 100 of 263 matches
Mail list logo
