solution to PS3 problem 2 using recursion:
if you use recurion to solve this you have to call the function with 3 parameters : target, key and 0. Where 0 initializes the begining of where you want to start checking the string. In this recursive version I cant slice the string.
from string import *

# the code below is PS3 problelm 2 using recursion.
#you have to call it with 3 parameters: target,key and 0 (as the begining point)
# also it puts the indexes in a list instead of a tuple but that is an easy switch

def match(t,k, beg):

mylist= []

if find

Question

solution to PS3 problem 2 using recursion:
if you use recurion to solve this you have to call the function with 3 parameters : target, key and 0. Where 0 initializes the begining of where you want to start checking the string.  In this recursive version I cant slice the string. 
from string import *




# the code below is PS3 problelm 2 using recursion.
#you  have to call  it with 3 parameters: target,key and 0 (as the begining point)
# also it puts the indexes in a list instead of a tuple but that is an easy switch

def match(t,k, beg):
   
   
    mylist= []
    
    if find

anonymous · Answer

sorry some of this got cut off the first time
def match(t,k, beg):
   
   
    mylist= []
    
    if find(t,k,beg) >=0:
        mylist = [find(t,k,beg)]
        beg = find(t,k,beg)+1

        mylist = mylist + match(t,k,beg)
       
        
    return mylist

anonymous · Answer

please us a code pasting site
dpaste.com
pastebin.com
codepad.org
and select Python for syntax highlighting

anonymous · Answer

not necessarily - but if you don't you may have to massage the result http://codepad.org/mP4T0PGl