|
-
November 12th, 2006, 02:40 PM
#1
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
-
November 13th, 2006, 04:48 PM
#2
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.
-
November 14th, 2006, 09:12 AM
#3
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
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|