From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: **
X-Spam-Status: No, score=2.1 required=5.0 tests=BAYES_20,INVALID_MSGID,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,932247808a15ef7b,start
X-Google-Attributes: gid103376,public
X-Google-Thread: 108717,932247808a15ef7b,start
X-Google-Attributes: gid108717,public
From: ddessert <d-dessert@ti.com>
Subject: Unrolling recursion [Q]
Date: 1997/12/18
Message-ID: <3499916A.47C8@ti.com>#1/1
X-Deja-AN: 299449874
Content-Transfer-Encoding: 7bit
Mime-Version: 1.0
Reply-To: d-dessert@ti.com
Content-Type: text/plain; charset=us-ascii
Organization: Texas Instruments Incorporated
Newsgroups: comp.programming,comp.lang.ada
Date: 1997-12-18T00:00:00+00:00
List-Id: <comp.lang.ada>


Does anyone have resources for unrolling recursive procedures?

In particular, I want to unroll a k-dimensional tree search,
which is fairly closely related to a binary tree search.  The
difference is that at each level of the tree, you would decide
left/right based on one of k different variables.

TIA,

Dave Dessert

e-mail: d-dessert@ti.com