CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com
Results 1 to 3 of 3
  1. #1
    Join Date
    Mar 2006
    Posts
    17

    Wink Finding Closest Pair of Points

    I am doin a small research on Divide and Conquer Algorithm(Not assignment)

    Can any one help in writing a code in cpp for finding closes pair of points using Divide and Conquer Algorithm.

    Do any one can help me in finding some cpp program in divide and conquer algorithm.

    Thank you in advance.

    Eshwar

  2. #2
    Join Date
    Oct 1999
    Location
    ks
    Posts
    524

    Re: Finding Closest Pair of Points

    have no idea what the divide and conquer algorithm is but i can say this:

    if you have n distinct points then there is no way you can find the pair with
    the least distance among them without doing the n * (n-1) /2 computations
    of distance.

  3. #3
    Join Date
    Jun 2002
    Location
    Moscow, Russia.
    Posts
    2,176

    Re: Finding Closest Pair of Points

    "Programs must be written for people to read, and only incidentally for machines to execute."

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  





Click Here to Expand Forum to Full Width

Featured