[A83] Re: Pythagorean's theorem

[A83] Re: Pythagorean's theorem

• To: <assembly-83@lists.ticalc.org>
• Subject: [A83] Re: Pythagorean's theorem
• From: "David Phillips" <david@acz.org>
• Date: Sun, 10 Aug 2003 17:06:00 -0500
• References: <000701c35eb2$4fa5a030$0201a8c0@brinstar> <14020.1060552004@www66.gmx.net>
• Reply-To: assembly-83@lists.ticalc.org

robvanwijk@gmx.net writes:
> Why not perform a binary search (look halfway, see if that value is
> larger or smaller, ...)? Seems like that would be a lot faster.

A binary search would be a lot faster in many cases.  I chose to describe
the algorithm using the simpler linear search.  Though for a small table, a
linear search might be faster.  A binary search has more overhead.

The problem with comparing an O(n) algorithm with O(log n) is that it says
nothing about the cost of n.

-- 
David Phillips <david@acz.org>
http://david.acz.org/

• [A83] Yet another integer square root routine (was: Pythagorean's theorem)
• From: "Wei Lin and Norbert Juffa" <juffa@earthlink.net>

• [A83] Re: Pythagorean's theorem
• From: "David Phillips" <david@acz.org>
• [A83] Re: Pythagorean's theorem
• From: robvanwijk@gmx.net

• Prev: [A83] Re: Pythagorean's theorem
• Next: [A83] Yet another integer square root routine (was: Pythagorean's theorem)
• Index(es):
  • Main
  • Thread