Developing Algorithm to Recursively Walk Array: arr[4] Example

AI Thread Summary
The discussion centers on the challenge of recursively traversing an array to generate specific combinations of indices, such as 012, 123, and 013. The original poster (OP) expresses difficulty in achieving certain combinations and questions the necessity of a recursive approach for this task. Participants suggest that recursion may not be the best solution for the problem at hand and encourage the OP to clarify the specific requirements and desired outputs. The conversation also touches on the concept of using the right tools for the problem, referencing the idea that relying solely on recursion can lead to ineffective solutions. A suggestion is made to consider implementing a "sentinel" to manage the end of sequences, which could help in generating the desired combinations. Overall, the thread highlights the importance of understanding the problem requirements before choosing an algorithmic approach.
anonim
Messages
39
Reaction score
2
TL;DR Summary
to walk around the array
I want to write code walk around the array recursively. For some reason I cannot share my code. Let's say I have a array like this: arr[4], I want to look 012 123 013 or 01 12 23 02 03 13. In code I write I can look 012 123 or 01 12 23 but I cannot look 013 or 02 03 13. What algorithm should I develop?
 
Technology news on Phys.org
  • Like
Likes FactChecker and Klystron
Filip Larsen said:
This is not a particularly recursive algorithm, so perhaps you can elaborate on why you think you need recursion (that is, what problem are you trying to solve)?
"If the only tool you have is a hammer, everything begins to look like a nail."
The OP has started a number of threads with the goal of trying to solve some problem by the use of recursion. For some of the problems, recursion isn't a viable solution.
 
  • Like
Likes jim mcnamara
@Mark44 - that is a great concept-
"If the only tool you have is a hammer, everything begins to look like a nail."
Where did you encounter that?
 
jim mcnamara said:
@Mark44 - that is a great concept-
"If the only tool you have is a hammer, everything begins to look like a nail."
Where did you encounter that?
It might have been in a programming class I took back in the early 80s.
 
I started to sketch such a recursive program, but I had not written more than 7 or 8 lines before i stopped. I suddenly discovered that my mantra in programming was not satisfied - I had not written a requirement spec (what is the desired output of the program) or a program design (how do we go about solving this using a recursive method). And then I found out that it was too much work anyhow.
 
One thing I thought of late yesterday night: You need a "sentinel" (meaning end-of-sequence) in your list (otherwise you will only get resulting sequences the same size as your list of symbols).
 
jim mcnamara said:
@Mark44 - that is a great concept-
"If the only tool you have is a hammer, everything begins to look like a nail."
Where did you encounter that?
It is related to the "Golden Hammer".
But the first use I heard of it was in the early 1980's.
The US Senate was looking at the burgeoning use of CT Scan machines - and the problems that were arising when more of these machines were being purchased by hospitals within a market area then the patient population in that area could ever use. One Senator's remark went something like this: If you've just spent $3 million on a CT Scanner, everything looks like a nail.
 
  • Like
Likes jim mcnamara
jim mcnamara said:
@Mark44 - that is a great concept-
"If the only tool you have is a hammer, everything begins to look like a nail."
Where did you encounter that?
I heard it as "give a kid a hammer, and everything needs poundin'" ##-## in various forms, it's an old saw.
 

Similar threads

Replies
23
Views
2K
Replies
22
Views
4K
Replies
3
Views
4K
Replies
1
Views
1K
Replies
16
Views
2K
Back
Top