How to recursive solve a fractional Knapsack problem in Java with log(n) time.

Note!! And return a boolean array of each being take(T) or not take(F)

this output shoud be: take=[0,1,1]

static double[] fractionalKnap(double[] values, int[] weights, int k) {

double[] take = new double[values.length];

return take;

}

0-1 Knapsack Problem Weight 10; Value 60; Weight 20; Value 100; Weight = 30; Value = 120; Weight = (20+10): Value = (100+60); Weight = (30+10): Value = (120+60); Weight = (30+20): Value = (120+100); Weight = (30+20+10) > 50 value1 = {60, 100, 120); weigh 3(10, 20, 30); W = 50; Solution: 220