- Greedy, knapsack, Recursion

Maximum sum of values of N items in 0-1 Knapsack by reducing weight of at most K items in half

import java.io.*;import java.util.*;  class GFG {          static int maximum(int value[],                       int weight[], int weight1,                       int flag, int K, int index)    {                  if (index >= value.length) {              return 0;        }                          if (flag == K) {                          int skip = maximum(value,                               weight, weight1,                               flag, K, index + 1);              int full = 0;                                                              if (weight[index]