UserFriendly Strip Comments


	The Daily Static UF Archives Register UF Membership Ad Free Site Postcards Community Geekfinder UFie Gear Advertise on UF Forum Rules & FAQ Username Password Create a New Account

Back to UserFriendly Strip Comments Index

recursive -> iterative	by dennismv	2004-12-21 02:24:43
I don't have time to give a full answer...	by Liava	2004-12-21 03:55:22
Qsort	by dennismv	2004-12-21 04:15:00
I'd still call that a recursive solution, though	by Liava	2004-12-21 04:30:46
recursion	by dennismv	2004-12-21 04:50:19
Then by this definition the answer to the question (of converting recursion to iteration without using a stack) is indeed no, like you've said. What I want to do though is to eliminate the line where a function is calling itself. Since I am not sure if my function can be converted to a tail-recursive one, I'm perfectly fine with using a stack explicitly. Perhaps it is a trivial conversion, yet I was not able to do it with my program. That's why I'm looking for a general way if there is one.
[ Reply ]
I have gotten rid of the recursive call	by Version0.1	2004-12-21 08:40:48
Well, the algorithm is as follows:	by Liava	2004-12-21 11:46:07
ok	by dennismv	2004-12-21 19:34:10
Not what I meant	by Liava	2004-12-21 22:05:31
Much of this could be avoided.	by williamashbless	2004-12-21 23:32:22

[Todays Cartoon Discussion] [News Index]

Come get yer ARS (Account Registration System) Source Code here!
All images, characters, content and text are copyrighted and trademarks of J.D. Frazer except where other ownership applies. Don't do bad things, we have lawyers.
UserFriendly.Org and its operators are not liable for comments or content posted by its visitors, and will cheerfully assist the lawful authorities in hunting down script-kiddies, spammers and other net scum. And if you're really bad, we'll call your mom. (We're not kidding, we've done it before.)