I Heuristic Knapsack Solver Algorithm

In computer science, artificial intelligence, and mathematical optimization, a heuristic (from Greek εὑρίσκω" I find, observe") is a technique designed for solve a problem more quickly when classic methods are too slow, or for finding an approximate solution when classic methods fail to find any exact solution. This is achieved by trading optimality, completeness, accuracy, or preciseness for speed.

I Heuristic Knapsack Solver source code, pseudocode and analysis