Article View: comp.lang.misc
Article #2010Re: Aggressive optimization
From: Dan Bernstein
Date: Sat, 10 Nov 1990 08:37
Date: Sat, 10 Nov 1990 08:37
14 lines
989 bytes
989 bytes
In article <5491@lanl.gov> jlg@lanl.gov (Jim Giles) writes: [ given any code using pointer arithmetic, the compiler can convert ] [ it into array code that is just as fast ] That's true. However, the compiler cannot figure out the optimal code either way! You're ignoring the problem once again. You *have* to let the programmer shift his arrays manually, because no algorithm can produce the optimal shifts for a program. Jim, you've made a blanket assertion that arrays are as efficient as pointers. I've proven you wrong. Give up. ---Dan
Technical Details
Message-ID:
<7001:Nov1008:37:2690@kramden.acf.nyu.edu>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rutgers!njin!princeton!udel!haven!adm!cmcl2!kramden.acf.nyu.edu!brnstndReferences:
<24232:Nov905:50:0690@kramden.acf.nyu.edu> <5491@lanl.gov>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rutgers!njin!princeton!udel!haven!adm!cmcl2!kramden.acf.nyu.edu!brnstnd From: brnstnd@kramden.acf.nyu.edu (Dan Bernstein) Newsgroups: comp.lang.misc Subject: Re: Aggressive optimization Message-ID: <7001:Nov1008:37:2690@kramden.acf.nyu.edu> Date: 10 Nov 90 08:37:26 GMT References: <24232:Nov905:50:0690@kramden.acf.nyu.edu> <5491@lanl.gov> Organization: IR Lines: 14