Tuesday, April 04, 2006


def findspot(self,num,array,low,high):
mid=(low+high)/2
if high==low:
if num>array[low]:
return high
else:
return low
else:
if num return self.findspot(num,array,low,mid)
elif num>array[mid]:
return self.findspot(num,array,mid+1,high)
else:
return mid

def sort(self):

items = self.cards
sorts=[Card(),Card()]
done = 0
for i in items:
if done == 0:
sorts[0]=i
else:
spot=self.findspot(i,sorts,0,done)
sorts[spot:spot]=[i]
done=done+1
self.cards = sorts[:len(sorts)-1]

No comments:

The OFFICIAL Dilbert Widget