Click here to Skip to main content
15,886,788 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
please i need to convert the following code to iterative instead of recursive. this code solve the partial digest problem in dna.
def Place(L, X):
if L==[]:
X1 = copy.deepcopy(X)
X1.sort()
print X1
return True

width = max(X)
if debug:
print L
print X
print '------------'

L1 = copy.deepcopy(L)
X1 = copy.deepcopy(X)

y = max(L)
diff = diffGen(y, X)
if set(diff) <= set(L):
X += [y]
L = diffSet(diff, L)
flag = Place(L,X)

L = L1
X = X1
y = width - max(L)
diff = diffGen(y, X)
if set(diff) <= set(L):
X += [y]
L = diffSet(diff,L)
flag = Place(L,X)

return
Posted

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



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900