Solution to PS3 problem 1 recursion
## slices the target each time a match is found and calls the function again
## with the new slice
## uses a counter to keep track of how many times a match is found.
## returns the counter to the recursive call

from string import *
def match(t,k):

here= find(t,k)
count=0

if find(t,k) =0:
count+=1
count = count + match(t[here+1:],k)

return count

target1 = 'atgacatgcacaagtatgcat'
target2 = 'atgaatgcatggatgtaaatgcag'

# key strings

key10 = 'a'
key11 = 'atg'
key12 =

Question

Solution to PS3 problem 1 recursion
## slices the target each time a match is found and calls the function again
## with the new slice
## uses a counter to keep track of how many times a match is found.
##      returns the counter to the recursive call

from string import *
def match(t,k):

    here= find(t,k)
    count=0
    
    if find(t,k) >=0:
        count+=1        
        count = count + match(t[here+1:],k)
                
    return count

target1 = 'atgacatgcacaagtatgcat'
target2 = 'atgaatgcatggatgtaaatgcag'

# key strings

key10 = 'a'
key11 = 'atg'
key12 =

anonymous · Answer

Good Job skibum!Thanks for posting!