Iteration to Recursion in Python

Question

How can I write this function Recursively:

def count(lst, value):
    c = 0
    for i in range(lst.size):
        if get(lst,i) == value:# get(lst, i) is predefined. It gives me the value at i in lst
            c = c + 1
    return c

This is very strange code for Python. the for i in range() is unusual, as is the get(lst, i). — kojiro
– kojiro, Commented Apr 6, 2014 at 3:01

OrangeCube · Accepted Answer · 2014-04-06 03:26:04Z

1

Seems you wanna count how many elements in lst is equal to value

IMHO, instead of doing this, you could get the count in just one short line:

lst.count(value)

edited Apr 6, 2014 at 3:26

answered Apr 6, 2014 at 3:10

OrangeCube

3982 silver badges14 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

Ruben Bermudez · Accepted Answer · 2014-04-06 03:01:35Z

0

This should make the trick:

def recount(lst, value):
    if len(lst) == 0:
        return 0
    if get(lst,0) == value:
        return 1 + recount(lst[1:],value)
    else:
        return recount(lst[1:], value)

answered Apr 6, 2014 at 3:01

Ruben Bermudez

2,32315 silver badges22 bronze badges

1 Comment

kojiro Over a year ago

Or just use the integer value of the boolean: return int(get(lst, 0) == value) + recount(lst[1:], value)

Collectives™ on Stack Overflow

Iteration to Recursion in Python

How can I write this function Recursively:

2 Answers 2

Comments

1 Comment

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

How can I write this function Recursively:

2 Answers 2

Comments

1 Comment

Your Answer

Sign up or log in

Post as a guest

Related