Xref: utzoo comp.lang.c:11280 comp.arch:5441
Path: utzoo!utgpu!water!watmath!clyde!att!alberta!calgary!radford
From: radford@calgary.UUCP (Radford Neal)
Newsgroups: comp.lang.c,comp.arch
Subject: Re: Self-modifying code (and space/time complexity)
Summary: Implications for space and time complexity of algorithms
Keywords: self-modifying code, generate-and-execute
Message-ID: <1744@vaxb.calgary.UUCP>
Date: 13 Jul 88 19:41:09 GMT
References: <3353@cognos.UUCP> <619@goofy.megatest.UUCP> <429@uwovax.uwo.ca> <12360@ut-sally.UUCP>
Organization: U. of Calgary, Calgary, Ab.
Lines: 88


There are interesting cases where on-the-fly generation of code seems
to be essential to get good asymptotic space and/or time complexity.

Consider the following code fragment (version A):

     for (i = 0; i