How to make a greedy algorithm to solve the backpack problem in java [closed]

You need to join a research team from some of the world's projection colleges - preferably technology-savvy, such as Caltech or MIT. Spend years studying, leading a multidisciplinary team, and perhaps developing some new hardware (or using quantum processors) you can. What I've said so far may sound like sarcasm, but I swear it's not. I'm serious.

The problem of the backpack is a problem NP-complete . I will not go into the smallest technical details, but it is enough to know at the moment that, for all practical purposes, none of these problems has ever been solved to the satisfaction of a computable algorithm.

If you can solve the problem of the backpack, you can finally find out if P! = NP. It's the hint, this is worth a million dollars award from the Clay Mathematics Institute . p>