We study the average behaviour of the well-known greedy algorithms for the one-dimensional knapsack problem with Boolean variables when the number of variables n tends to infinity. It is supposed that the right-hand side ...