How do I perform this function recursively?

Question

0.00/5 (No votes)

See more:

# totalIndexSeq = ['0+234+6+', '++++++', '012++5678']

def longestSeqFinder(totalIndexSeq):
    positionCounter = 0
    positionChecker = 0
    tryList = []
    longestSeqList = []

    for y in totalIndexSeq:

        temp = y.split("+")
        tryList.append(temp)

    for i in tryList:
        longestSeq = (max(i, key = len))
        longestSeqList.append(longestSeq)

What I have tried:

I am new to coding, and I'm honestly not sure where to begin.

Posted 20-Apr-19 6:45am

Bobdoesmathall

Updated 22-Apr-19 11:38am

Add a Solution

Comments

CPallini 20-Apr-19 15:21pm

I see no use for recursion in such a function. I mean iteration is fine there.

Richard MacCutchan 21-Apr-19 4:53am

Since you are new I would suggest you forget about recursion until you have more experience, and can understand when it may be useful. In the above case recursion is unlikely to help you.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Christian Graus · Answer 1 · 2019-04-22T11:39:00

Recursion means the function calls itself. If your function calls itself, it's using recursion. An obvious use for recursion would be to navigate a tree, the method always goes through the children of a node, and calls itself. When the tree ends, the recursion ends.

I've had interview questions that ask me to write a recursive function where it makes no sense. Recursion is not a complex thing, there's tons of tutorials and examples. If you want to learn recursion, I'd suggest the starting point is using an example where it makes sense to use it