Training, Open Source computer languages
PerlPHPPythonMySQLApache / TomcatTclRubyJavaC and C++LinuxCSS 
Search for:
Home Accessibility Courses Diary The Mouth Forum Resources Site Map About Us Contact
Is Tcl Recursive?

Posted by admin (Graham Ellis), 27 October 2007
I'm posting this up here - a question asked on a Tcl course - is Tcl recursive?  ((Which basically means "can a proc call itself")).  The answer is yes, and here is the classic proof, using recursion to generate  a factorial number

Code:
# Is Tcl Recursive?

# Yes - if you *must*!!

proc factorial this {
       if {$this > 1} {
               return [expr $this * [factorial [expr $this -1]]]
       }
       return 1
       }
# Stack limit between 800 and 1000 levels
puts [factorial 10]




This page is a thread posted to the opentalk forum at www.opentalk.org.uk and archived here for reference. To jump to the archive index please follow this link.

You can Add a comment or ranking to this page

© WELL HOUSE CONSULTANTS LTD., 2014: Well House Manor • 48 Spa Road • Melksham, Wiltshire • United Kingdom • SN12 7NY
PH: 01144 1225 708225 • FAX: 01144 1225 899360 • EMAIL: info@wellho.net • WEB: http://www.wellho.net • SKYPE: wellho