cvs.gedasymbols.org/archives/browse.cgi   search  
Mail Archives: djgpp/1997/07/30/04:30:15

From: Jens Bischoff <J DOT Bischoff AT airbus DOT dasa DOT de>
Message-Id: <9707300828.AA18334@hpschrot.bre.da>
Subject: Re: Find Path
To: noaccess9 AT aol DOT com (No Access9) (No Access9)
Date: Wed, 30 Jul 97 10:28:04 MESZ
Cc: djgpp AT delorie DOT com
In-Reply-To: <19970729202400.QAA08004@ladder01.news.aol.com>; from "No Access9" at Jul 29, 97 8:24 pm
Mailer: Elm [revision: 70.85]

Hi!

> 
> 
> My problem is that I can't understand why it takes so much longer
> only because the mines are layed differently. So I assume there is
> a bug in djgpp V2.7.2.1. But there may also be a problem with my
> recursion. So if you have a better one it would be nice to hear
> about that.

No, there's no bug in djgpp. I compiled & checked this program on
a HP workstation with both gcc and HP-C, and the execution times
are also very different (But on this machine the second example
is much faster than the first one). 
It seems to me that you have to improved your algorithm a little bit....

(Sorry that I write this in Englisch, it's because this is sent to 
the DJGPP mailing list, too).

--
|      |      | Jens Bischoff   |   Daimler-Benz Aerospace Airbus |
|   --<O>--   +-----------------+---------------------------------+
|      |      | Aerodynamic Data Department (EFD)                 |
| Dasa Airbus | Huenefeldstrasse 1-5     D-28199 Bremen (Germany) |

- Raw text -


  webmaster     delorie software   privacy  
  Copyright © 2019   by DJ Delorie     Updated Jul 2019