Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > microsoft.public.excel.programming > #110119
| From | Bruno Campanini <brunocam@libero.it> |
|---|---|
| Newsgroups | microsoft.public.excel.programming |
| Subject | Re: Recursive To non-Recursive Procedure |
| Date | 2017-07-17 10:52 +0200 |
| Organization | Aioe.org NNTP Server |
| Message-ID | <okhtrt$1s0k$1@gioia.aioe.org> (permalink) |
| References | (3 earlier) <XnsA7B2806505C70auricauricauricauric@213.239.209.88> <okba18$v68$1@gioia.aioe.org> <okg5nl$tl4$1@dont-email.me> <okg92n$1hlg$1@gioia.aioe.org> <okgc2u$ipj$1@dont-email.me> |
Peter T explained : > "Bruno Campanini" <brunocam@libero.it> wrote in message >> Peter T formulated the question : >>> "Bruno Campanini" <brunocam@libero.it> wrote in message >>>> >>>>>>> On the other hand, *why* do you want it to be unrolled? >>>>>> >>>>>> Why you ask me that? >>> >>> You seem reluctant to give a reason. Is this homework to find a less >>> elegant non-recursive alternative as an exercise? >>> >>>>> Here's a Google search that'll get you started: >>>>> https://www.google.com/search?q=string+permutation+non-recursive >>>> Really I don't need that. >>> >>> Why not? I found several potential solutions in a few minutes. >> Oh... you are a very clever man, congratulation! >> Why don't you read accurately before writing? >> >> I don't need any practical solution, it's only a matter of >> principle. >> I would be able to convert that particular algorithm into a >> non-recursive procedure, but I'm unable to do so. >> Then I put here the question. >> >> Have I satisfied your curiosity? > > Not really a matter of curiosity, often asking the objective leads to a > different approach the OP might not have considered, particularly when the > reason for the question is not clear. So it's a sort of intellectual exercise > then, right? > > Although any approach will end up doing essentially the same thing your > algorithm is not directly convertible as it's designed to be recursive. Any recursive algorithm is convertible into a non-recursive one... and vice-versa! The cost may be a great difficulty, a loss of simplicity, a loss of efficiency. >> Oh... you are a very clever man, congratulation! > Huh, it was a simple search, why the sarcasm, why not try yourself! Such a simple search that I tried just before you was born! >> Why don't you read accurately before writing? > AFAIK I did read accurately before posting. Not sure why you're so aggressive > to people who try to help you. Not to all people, only to all who: - didn't understand the question - doesn't have an idea about the solution. - doesn't hesitate to spend unuseful words... as it costs nothing! Bruno
Back to microsoft.public.excel.programming | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Recursive To non-Recursive Procedure Bruno Campanini <brunocam@libero.it> - 2017-07-13 15:14 +0200
Re: Recursive To non-Recursive Procedure "Auric__" <not.my.real@email.address> - 2017-07-13 19:52 +0000
Re: Recursive To non-Recursive Procedure Bruno Campanini <brunocam@libero.it> - 2017-07-14 00:32 +0200
Re: Recursive To non-Recursive Procedure "Auric__" <not.my.real@email.address> - 2017-07-14 19:33 +0000
Re: Recursive To non-Recursive Procedure Bruno Campanini <brunocam@libero.it> - 2017-07-14 22:36 +0200
Re: Recursive To non-Recursive Procedure "Peter T" <askformy@gmail.com> - 2017-07-16 17:58 +0100
Re: Recursive To non-Recursive Procedure Bruno Campanini <brunocam@libero.it> - 2017-07-16 19:51 +0200
Re: Recursive To non-Recursive Procedure "Peter T" <askformy@gmail.com> - 2017-07-16 19:46 +0100
Re: Recursive To non-Recursive Procedure Bruno Campanini <brunocam@libero.it> - 2017-07-17 10:52 +0200
Re: Recursive To non-Recursive Procedure "Peter T" <askformy@gmail.com> - 2017-07-17 12:45 +0100
Re: Recursive To non-Recursive Procedure Bruno Campanini <brunocam@libero.it> - 2017-07-17 20:17 +0200
Re: Recursive To non-Recursive Procedure Living the Dream <noodnutt@gmail.com> - 2017-08-08 05:23 -0700
Re: Recursive To non-Recursive Procedure "Peter T" <askformy@gmail.com> - 2017-08-11 17:43 +0100
Re: Recursive To non-Recursive Procedure Bruno Campanini <brunocam@libero.it> - 2017-08-13 02:19 +0200
Re: Recursive To non-Recursive Procedure "Peter T" <askformy@gmail.com> - 2017-08-13 17:26 +0100
Re: Recursive To non-Recursive Procedure Bruno Campanini <brunocam@libero.it> - 2017-08-14 20:24 +0200
Re: Recursive To non-Recursive Procedure GS <gs@v.invalid> - 2017-08-14 23:14 -0400
Re: Recursive To non-Recursive Procedure "Peter T" <askformy@gmail.com> - 2017-08-15 08:19 +0100
Re: Recursive To non-Recursive Procedure GS <gs@v.invalid> - 2017-08-15 03:28 -0400
Re: Recursive To non-Recursive Procedure "Peter T" <askformy@gmail.com> - 2017-08-15 08:39 +0100
Re: Recursive To non-Recursive Procedure Bruno Campanini <brunocam@libero.it> - 2017-08-15 12:49 +0200
Re: Recursive To non-Recursive Procedure "Peter T" <askformy@gmail.com> - 2017-08-15 08:35 +0100
Re: Recursive To non-Recursive Procedure Bruno Campanini <brunocam@libero.it> - 2017-08-15 11:17 +0200
Re: Recursive To non-Recursive Procedure "Peter T" <askformy@gmail.com> - 2017-08-15 13:21 +0100
Re: Recursive To non-Recursive Procedure Bruno Campanini <brunocam@libero.it> - 2017-08-15 18:19 +0200
Re: Recursive To non-Recursive Procedure Bruno Campanini <brunocam@libero.it> - 2017-08-13 03:16 +0200
Re: Recursive To non-Recursive Procedure Living the Dream <noodnutt@gmail.com> - 2017-08-29 06:08 -0700
csiph-web