fchristofrank

def fractional_knapsack(VperW,W):
    '''This function implements the fractional knapsack problem'''
    i = 0
    Value = 0
    count = 0
    # sort to reduce the time complexity. You need not find the max in the list
    # at every iteration
    VperW = sorted(VperW.items(),reverse =True)
    while i<n and W != 0:
        a = min(W,VperW[i][1][1])

fchristofrank

# include <stdio.h>
# include <malloc.h>

typedef struct node 
{
	int data;
	struct node * link;
}node;

node* linkedlist(int n)