Xref: utzoo comp.edu:3613 uw.general:1835
Newsgroups: comp.edu,uw.general
Path: utzoo!utgpu!watserv1!watdragon!gvcormack
From: gvcormack@watdragon.waterloo.edu (Gordon V. Cormack)
Subject: Re: Recursion?
Message-ID: <1990Oct5.174739.17208@watdragon.waterloo.edu>
Organization: University of Waterloo
References: <1990Oct5.170251.14806@watdragon.waterloo.edu>
Date: Fri, 5 Oct 90 17:47:39 GMT
Lines: 9


Generating all permutations (or substrings) of a string is a
simply stated problem that justifies recursion.

Traversing a hierarchical database is less simply stated, but
may appeal to COBOL programmers.
-- 
Gordon V. Cormack     CS Dept, University of Waterloo, Canada N2L 3G1
gvcormack@waterloo.EDU  gvcormack@uwaterloo.CA  gvcormac@water.BITNET