Path: utzoo!attcan!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!rutgers!iuvax!bsu-cs!dhesi
From: dhesi@bsu-cs.UUCP (Rahul Dhesi)
Newsgroups: comp.lang.c
Subject: Re: Array indexing vs. pointers...
Message-ID: <4250@bsu-cs.UUCP>
Date: 10 Oct 88 03:14:06 GMT
References: <225800077@uxe.cso.uiuc.edu> <208@obie.UUCP>
Reply-To: dhesi@bsu-cs.UUCP (Rahul Dhesi)
Organization: CS Dept, Ball St U, Muncie, Indiana
Lines: 15

In article <208@obie.UUCP> wes@obie.UUCP (Barnacle Wes) writes:
>One thing to
>keep in mind here is that in general, you are wasting your time trying
>to optimize the entire program.  Most programs spend a large amount of
>their processing time in a few critical routines.

Let's remember that this behavior is true only for *unoptimized*
programs.

After you have located the critical routines and speeded them up, the
program will spend a large amount of its processing time spread over
many routines.  *Now*, if you want further significant speed-ups, you
can't just find a few hot spots.
-- 
Rahul Dhesi         UUCP:  <backbones>!{iuvax,pur-ee}!bsu-cs!dhesi