Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site elsie.UUCP
Path: utzoo!watmath!clyde!akgua!mcnc!decvax!ittvax!dcdwest!sdcsvax!bmcg!cepu!trwrba!trwrb!sdcrdcf!hplabs!hao!seismo!rlgvax!cvl!elsie!mark
From: mark@elsie.UUCP
Newsgroups: net.lang.c
Subject: Re: Comments on book review
Message-ID: <897@elsie.UUCP>
Date: Fri, 4-May-84 12:57:46 EDT
Article-I.D.: elsie.897
Posted: Fri May  4 12:57:46 1984
Date-Received: Tue, 8-May-84 07:09:10 EDT
References: <3231@fortune.UUCP>
Organization: NIH-LEC, Bethesda, MD
Lines: 30

<>
The most complicated program I ever wrote was conceived just before I went on
a two week vacation to the north coast of Maine. The nearest terminal was
100 miles away (that I knew of). For two weeks I carefully planned the
program and wrote out the code long hand. Raising before dawn, before wife and
child, hacking, hacking hacking (no, I'm not divorced, at least not yet).
Carefully, I packed pages and pages into by suitcase and could hardly wait
till I got home. My daughter's teddy bear is still in the cabin -- a victim
of scientia.

I may have gotten as far as "main(argc,argv)" before I realized it wouldn't
work. And the final product looks nothing like what I planned in the wilds
of Maine.

It was actually a good experience, and not all wasted time. There is such a
thing as over planning. Now I sit down and work out a general plan for the
program; make sure I have math right; have an idea of what my input should
be and my output should look like; use LOTS of subroutines and VERY FEW
globals; and proceed, more or less, by the interitive programming technique.

Of course, not all my programming is like this and different people have
different techniques. How you proceed also depends on how well you know the
language and how good your memory is (mine's bad). There probably is no such
thing as the best programming technique, just the best for you personally.

-- 
Mark J. Miller
NIH/NCI/DCE/LEC
UUCP:	decvax!harpo!seismo!rlgvax!cvl!elsie!mark
Phone:	(301) 496-5688