Welcome to BrainDen.com - Brain Teasers Forum
|Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account.
As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends.
Of course, you can also enjoy our collection of amazing optical illusions and cool math games.
If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top.
If you have a website, we would appreciate a little link to BrainDen.
Thanks and enjoy the Den :-)
Posted 20 May 2014 - 11:57 PM
you are given a list of 100 coordinates, and asked to use the pathageoran theorm he fewest number of times to determine the shortest distance between any two. is it an n^2 problem, or can you do better? how much better?
Posted 21 May 2014 - 07:34 PM
Spoiler for For starters
Posted 22 May 2014 - 12:57 AM
k-man, you're right.
I took the problem as minimizing the number of Pythagorean steps, even if doing O(n2) simpler ones.
I like your approach. You do programming and algorithms better than I do.
Vidi vici veni.
0 user(s) are reading this topic
0 members, 0 guests, 0 anonymous users