What else can you do? if the problem is inherently recursive, Like qsort?

What else can you do? if the problem is inherently recursive, Like qsort?

所有跟贴·加跟贴·新语丝读书论坛

送交者: steven 于 2008-02-08, 02:06:12:

回答: 1. recursive functions are not efficient 2. 1x2=2x1, if you know what I mean 由 008 于 2008-02-08, 01:46:55:

1. recursion should be avoided for trees. 2. "层数越多就越慢" is - 008 (355 bytes) 2008-02-08, 02:39:56 (204054)
- I was trying to guide them to the difference between recursive - steven (269 bytes) 2008-02-08, 15:40:46 (204147)
- by using a bookkeeping stack data structure - wasguru (111 bytes) 2008-02-08, 15:08:42 (204139)
- how do you avoid recursion when you deal with tree? (无内容) - steven (0 bytes) 2008-02-08, 10:10:19 (204081)