[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Tail recursion (WAS: Grouping problem?)

Subject: Tail recursion (WAS: Grouping problem?)
From: "Conal Tuohy" <conalt@xxxxxxxxxxxxxxx>
Date: Wed, 23 Apr 2003 20:03:01 +1200
 Tail recursion (WAS: Grouping problem?)
Dimitre wrote:

>You can use a DVC (Divide and Conquer) style algorithm here. Split a
>node-set into two and recursively solve the problem on them.

<snip/>

>The recursion depth of a DVC algorithm is only log2(N).
>
>http://www.topxml.com/code/default.asp?p=3&id=v20020107050418

OK - log(n) is better than (n), but why use a DVC algorithm to minimise
stack-depth if a tail-recursive algorithm would eliminate the procedure
stack altogether?

Does anyone have details of processors that implement optimised
tail-recursion, and under what circumstances?


 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list


Current Thread

PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
Email
First Name
Last Name
Company
Subscribe in XML format
RSS 2.0
Atom 0.3
Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.