Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!news.glorb.com!news.ripco.com!news-out.news.tds.net!newsreading01.news.tds.net!53ab2750!not-for-mail From: "Eric Sosman" Subject: Re: Do C++ and Java professionals use UML?? Message-ID: <5016CF3D.55590.calajapr@time.synchro.net> X-Comment-To: Robert Klemme Newsgroups: comp.lang.java.programmer In-Reply-To: <50158978.55547.calajapr@time.synchro.net> References: <50158978.55547.calajapr@time.synchro.net> X-FTN-AREA: COMP.LANG.JAVA.PROGRAMMER X-FTN-MSGID: 1:261/38 78e5cad8 X-FTN-REPLY: 1:261/38 53b65b28 Content-Type: text/plain; charset=IBM437 Content-Transfer-Encoding: 8bit X-Gateway: time.synchro.net [Synchronet 3.16a-Win32 NewsLink 1.98] Lines: 57 Date: Mon, 30 Jul 2012 19:00:43 GMT NNTP-Posting-Host: 69.21.70.65 X-Complaints-To: news@tds.net X-Trace: newsreading01.news.tds.net 1343674843 69.21.70.65 (Mon, 30 Jul 2012 14:00:43 CDT) NNTP-Posting-Date: Mon, 30 Jul 2012 14:00:43 CDT Organization: tds.net Xref: csiph.com comp.lang.java.programmer:16619 To: Robert Klemme From: "Eric Sosman" To: Robert Klemme From: "Eric Sosman" To: Robert Klemme From: "Eric Sosman" To: Robert Klemme From: Eric Sosman On 7/28/2012 12:36 PM, Robert Klemme wrote: > On 27.07.2012 23:11, David Lamb wrote: > >> I taught introductory programming for several years in several >> languages. You don't need to get as complex as backtracking. The natural >> places to teach recursion to introductory students are with binary tree >> search and quicksort, both of which can be taught in the first or second >> 1-semester course. > > Right. Although I'd consider Quicksort too complex as an introduction > to recursion as the algorithms workings are not so easy to grasp and > would distract from the concept of recursion. Tree search seems to be > the most appropriate to me. Still, introducing recursion as a concept > in programming does not belong into class reference documentation. This > is something for a tutorial or other introductory material. Tree *traversal* is a good recursion example, but I can't think of a good a priori reason to *search* recursively in an ordinary ordered tree. Maybe in a different sort of tree where you sometimes pursue multiple branches instead of choosing just one ... But that seems more complicated than Quicksort. -- Eric Sosman esosman@ieee-dot-org.invalid -+- BBBS/Li6 v4.10 Dada-1 + Origin: Prism bbs (1:261/38) -+- Synchronet 3.16a-Win32 NewsLink 1.98 Time Warp of the Future BBS - telnet://time.synchro.net:24 -+- BBBS/Li6 v4.10 Dada-1 + Origin: Prism bbs (1:261/38) -+- Synchronet 3.16a-Win32 NewsLink 1.98 Time Warp of the Future BBS - telnet://time.synchro.net:24 -+- BBBS/Li6 v4.10 Dada-1 + Origin: Prism bbs (1:261/38) -+- Synchronet 3.16a-Win32 NewsLink 1.98 Time Warp of the Future BBS - telnet://time.synchro.net:24 --- BBBS/Li6 v4.10 Dada-1 * Origin: Prism bbs (1:261/38) --- Synchronet 3.16a-Win32 NewsLink 1.98 Time Warp of the Future BBS - telnet://time.synchro.net:24