Java

UVa 102. Ecological Bin Packing | with Brute-force search

07 Mar 2013 Algorithm

The UVa 102: Ecological Bin Packing can be solved using brute-force search, as outlined in the following Java code snippet. Note that, the primary function getOPTConfiguration iterates over all possible bin arrangements, and

UVa 100. The 3n+1 Problem: Solving with a Brute-force Algorithm

21 Feb 2013 1 min read brute-force

The UVa 100: The 3n+1 Problem is about collatz problem, which we have discussed in details in a recent post. The following Java code describes a brute-force algorithm to solve this problem.