Hi,
On a plane if there are n points. How to find out if there are three (3)
points which are collinear in O(N**2log n) time. I got a solution which uses
extra space. But i need a solution which doesn't use any extra space.
Thanks,
Raghavendra
--~--~-~--~~~---~--~--
On May 29, 10:43 am, "Akhil Ravidas" <[EMAIL PROTECTED]> wrote:
> On Thu, May 29, 2008 at 8:08 PM, Geoffrey Summerhayes <[EMAIL PROTECTED]>
> wrote:
>
> > Easiest way to find out implementation details is to
> > just read the header file on your implementation.
>
> Look for stl_tree.h .
>
No, loo
Look for stl_tree.h .
On Thu, May 29, 2008 at 8:08 PM, Geoffrey Summerhayes <[EMAIL PROTECTED]>
wrote:
>
> On May 29, 2:46 am, Vinodh <[EMAIL PROTECTED]> wrote:
> > I am reading about hashing techniques.
> > The map data structure available in C++ STL uses hashing techniques?
>
> It's been more t
On May 29, 2:46 am, Vinodh <[EMAIL PROTECTED]> wrote:
> I am reading about hashing techniques.
> The map data structure available in C++ STL uses hashing techniques?
It's been more than a few years since I looked at the
standard, but I believe the actual algorithm is left
unspecified.
There are
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 them. Some questions are of the type to validate my
understanding.
1) Suppose If I need to design a commonly referred Hash table, I
should allow inse
It uses Red Black trees.
On Thu, May 29, 2008 at 12:20 PM, Raghavendra Sharma <
[EMAIL PROTECTED]> wrote:
> Hi,
>
> map container in STL uses balanced binary search tree. It does not use
> hashing technique.
>
> Thanks,
> Raghavendra
>
>
> On Thu, May 29, 2008 at 12:16 PM, Vinodh <[EMAIL PROTECTE
