heh could u explain the question with a example..??!!
On Aug 18, 8:47 pm, ♪ ѕяiηivαѕαη ♪ <21.sr...@gmail.com> wrote:
> Hi..
> Can anyone here explain me /provide me with an algorithm/source code in C
> which efficiently finds out the *longest common substring in the given
> string??*
--
You rec
gt; family relationships. I have a second cousin whose name is the same as
> > > > mine. There would be two nodes distinct nodes in the tree with value
> > > > "David S Dodson." These nodes would have different parents and
> > > > grandparents, but the sam
Dodson." These nodes would have different parents and
> > > grandparents, but the same great-grandparents.
>
> > Nice example. Nevertheless family tree are suitable examples for general
> > trees rather than binary trees , isnt it ?
>
> > > Dave
>
>
t is totally empty? I mean a
binary tree with Zero elements?
2) A binary tree is partioned into three disjoint subsets. That means
all the elements in a binary tree should be unique? Duplicate elements
are allowed within a subtree? Any significance of this?
Thanks,
Vinodh
--~--~-~--~~-
re are two entries there. One is for "ab" and the
> other is "ba". you need to compare the key and you will choose "ab".
> That is the way.
>
>
>
> On Mon, Jun 2, 2008 at 2:46 PM, Vinodh <[EMAIL PROTECTED]> wrote:
>
> > If a hash collis
key value...Than
we have retrieved the wrong record. How such a scenario is handled?
Thanks,
Vinodh
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email
Hi Guys, Please give some insights on these. Thanks.
Vinodh
On May 29, 4:31 pm, Vinodh <[EMAIL PROTECTED]> wrote:
> Hi,
> For some time now I started studying Algos and Data Structures. I got
> these question when I was going through Hashing. Please help me
> answering th
logy is followed in commercial software development?
e.g., this could mean allocating for 20 records where in on average we
will be having only 10 keys and 10 records.
Thanks,
Vinodh
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google G
I am reading about hashing techniques.
The map data structure available in C++ STL uses hashing techniques?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to
t;[EMAIL PROTECTED]> wrote:
> Ask a question whose answer might help you begin to understand.
>
> Dave
>
> On May 28, 4:51 am, Vinodh <[EMAIL PROTECTED]> wrote:
>
>
>
> > The article does not make me understand even after a serious reading.
>
> > On May 28, 2
The article does not make me understand even after a serious reading.
On May 28, 2:42 pm, "Lukas Šalkauskas" <[EMAIL PROTECTED]>
wrote:
> here it is:http://en.wikipedia.org/wiki/Asymptotic_analysis
>
> On Wed, May 28, 2008 at 12:27 PM, Vinodh <[EMAIL PROTECTED]
Hi can anyone provide a simple easy to understand definition of
"Asymptotic Analysis"
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@goog
For traversing binary trees there are standard ways like,
- In order
- Pre Order
- Post Order
Questions Are:
The construction of the data as a binary tree is upto us. Am I right?
(I read somewhere 2n-n combinations are possible)
Is there any thing like it should be always ordered or sorted?
stant M, and so are swallowed up in the big O notation. Thus,
> > > > O(log2 x) = O(ln x) = O(log10 x).
>
> > > > It makes no difference what logarithm you use in big O notation.
>
> > > > Dave
>
> > > > On May 15, 6:52 am, "amitabh
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?**
Thanks,
Vinodh
--~--~-~--~~~---~--~~
You received this message because you are
The loop is at the end as you have said.
--~--~-~--~~~---~--~~
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 e
To find the length of the loop:1)You know the node where the two pointers have met.(say NodeX)2)Now make one pointer alone traverse through the loop.(Have a counter which increments for every move)3)It will come back to the same node (NodeX) after making 'length of the loop' jumps
ie the counter g
>>sorry i forgot to mentioned>>that array may or may not have a majority element.
If the array may or may not contain the majority element, then after
the last step(ie once you get the get the array with one element) ,
just iterate thru the original array once counting the number of
occurences of t
.Vinodh
--~--~-~--~~~---~--~~
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]
Hi jatin,
why not send the book to the group
vinodh
--~--~-~--~~~---~--~~
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
Hi,
I think there is a small modification in the equations :
X= (D2 + D1^2)/(2*D1)
Y= (D2 - D1^2)/(2*D1)
Vinodh
21 matches
Mail list logo
