partition_greedy, a MATLAB code which uses a greedy algorithm to seek a solution of the partition problem, in which a given set of integers is to be split into two groups whose sums are as close as possible.


The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.


partition_greedy is available in a MATLAB version.

Related Data and Programs:


change_making, a MATLAB code which considers the change making problem, in which a given sum is to be formed using coins of various denominations.

combination_lock, a MATLAB code which simulates the process of determining the secret combination of a lock.

combo, a MATLAB code which includes many combinatorial routines.

partition_brute, a MATLAB code which uses a brute force method to find solutions of the partition problem, in which a set of integers must be split into two subsets with equal sum.

satisfy, a MATLAB code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.

subset, a MATLAB code which enumerates, generates, ranks and unranks combinatorial objects including combinations, partitions, subsets, index sets, and trees.

subset_sum, a MATLAB code which seeks solutions of the subset sum problem.

tsp_brute, a MATLAB code which reads a file of city-to-city distances and solves the traveling salesperson problem, using brute force.


  1. Alexander Dewdney,
    The Turing Omnibus,
    Freeman, 1989,
    ISBN13: 9780716781547,
    LC: QA76.D45.
  2. Brian Hayes,
    The Easiest Hard Problem,
    American Scientist,
    Volume 90, Number 2, March-April 2002, pages 113-117.
  3. Silvano Martello, Paolo Toth,
    Knapsack Problems: Algorithms and Computer Implementations,
    Wiley, 1990,
    ISBN: 0-471-92420-2,
    LC: QA267.7.M37.

Source Code:

Last revised on 16 October 2022.