Unbounded Fractional Knapsack

Given the weights and values of n items, the task is to put these items in a knapsack of capacity W to get the maximum total value in the knapsack, we can repeatedly put the same item and we can also put a fraction of an item.

Examples:  

Input: val[] = {14, 27, 44, 19}, wt[] = {6, 7, 9, 8}, W = 50 
Output: 244.444

Input: val[] = {100, 60, 120}, wt[] = {20, 10, 30}, W = 50 
Output: 300 

Approach: The idea here is to just find the item which has the largest value to weight ratio. Then fill the whole knapsack with this item only, in order to maximize the final value of the knapsack.

Below is the implementation of the above approach: 

244.444

Time Complexity: O(n) where n is size of input array val and wt. This is because a for loop is being executed from 1 till n in knapSack function.

Space Complexity: O(1) as no extra space has been used.