Author: Omid David Tabibi
Date: 18:35:28 08/12/04
Go up one level in this thread
On August 12, 2004 at 21:04:51, Russell Reagan wrote: >On August 12, 2004 at 17:12:38, Anthony Cozzie wrote: > >>On August 12, 2004 at 16:19:06, Russell Reagan wrote: >> >>>On August 12, 2004 at 16:11:04, Omid David Tabibi wrote: >>> >>>>A good C++ program cannot run faster than a good C program doing same thing. >>>>Just like a good C program cannot run faster than a good Assembly program doing >>>>same thing. >>> >>>Theoretically true. Practically false. >> >>For computer chess: true. >> >>anthony > >So you're telling me that there has never been, and never will be a computer >chess program written in C that was faster than the equivalent assembly version, >and that there has never been, and never will be a computer chess program >written in C++ that was faster than the equivalent C program? > >If that's what you're telling me, then you're wrong. It happens. Optimizing >compilers make it so. Read again what I wrote: "A good C++ program cannot run faster than a **good** C program doing same thing. Just like a good C program cannot run faster than a **good** Assembly program doing same thing." If you can write a C++ program that runs faster than the equivalent C program, the conclusion would be that your C program is not good.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.