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=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,932247808a15ef7b
X-Google-Attributes: gid103376,public
X-Google-Thread: 108717,932247808a15ef7b
X-Google-Attributes: gid108717,public
From: Beeblebrox <jjan@cs.rug.nl>
Subject: Re: Unrolling recursion [Q]
Date: 1997/12/19
Message-ID: <349A7C9A.4AA2@cs.rug.nl>#1/1
X-Deja-AN: 308570316
Content-Transfer-Encoding: 7bit
References: <3499916A.47C8@ti.com>
Content-Type: text/plain; charset=us-ascii
Organization: Groningen University (NL)
Mime-Version: 1.0
Newsgroups: comp.programming,comp.lang.ada
Date: 1997-12-19T00:00:00+00:00
List-Id: <comp.lang.ada>


ddessert wrote:
> 
> 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.
> 
Sounds like B+-tree search. Check out datastructures handbooks.

-- 
Jan Jongejan                            8-{)   --me with moustache
Dept. Comp.Sci.,                       
Univ. of Groningen,                     and add a cigar...
Netherlands.
email: jjan@cs.rug.nl