dp1 | Python Fiddle

# size and value
sample_bag = [(5,1),(2,4),(4,6),(3,4),(8,4),(6,5),(3,3),(4,1),(3,1),(4,4),(7,6)]
total_size = 25

def knapsack_recurse(size_left, bag):
    if (not bag) or (size_left <= 0):
        return []
    
    item = bag.pop(0)
    
    if item[0] > size_left:
        return knapsack(size_left, bag)
    
    else:
        lst1 = knapsack(size_left-item[0],bag)
        lst2 = knapsack(size_left,bag)
        val1 = 0
        val2 = 0
        if lst1:
        	val1 = sum([it[1] for it in lst1])
        val1 += item[1]
        if lst2:
            val2 = sum([it[1] for it in lst2])
        if val1 > val2:
            lst1.append(item)
            return lst1
        else:
            return lst2    
    
# print knapsack_recurse(total_size,sample_bag)

def knapsack(size,bag):
    K = [[0 for x in range(len(bag)+1)] for x in range(size+1)]
    
    for i in range(1,len(bag)+1):
        for s in range(1,size+1):
            
            if bag[i-1][0] > s:
                K[i][s] = K[i-1][s]
                
            else:
                print bag[i-1][1] + K[i-1][s-bag[i-1][0]]
                K[i][s] = max( bag[i-1][1] + K[i-1][s-bag[i-1][0]],
                              K[i-1][s] )
                
    return K[len(bag)+1][size+1]
    
    
print knapsack(total_size,sample_bag)

Browser Version Not Supported

Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+ Firefox 4+ Safari 5+
IE 10+

Let me try anyway!

Python Fiddle

Python Cloud IDE