subset_sum_brute, a C code which uses brute force to solve the subset sum problem, to find a subset of a set of integers which has a given sum.
We are given a collection of (21) weights and a target value (24639098). We seek a combination of the weights which adds up to the target value.
The function subset_sum_serial() simply considers every possible subset of the weights, determines its sum, and compares that to the target value. The first case in which the target value is matched is returned as the solution.
The information on this web page is distributed under the MIT license.
subset_sum_brute is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.
closest_pair_brute, a C code which uses brute force to solve a 2D version of the closest pair problem, which identifies the closest pair of points in a given collection.
fft_serial, a C code which demonstrates the computation of a Fast Fourier Transform, and is intended as a starting point for developing a parallel version using OpenMP.
fire_simulation, a C code which simulates a forest fire over a rectangular array of trees, starting at a single random location. It is intended as a starting point for the development of a parallel version.
heated_plate, a C code which solves the steady state heat equation in a 2D rectangular region, and is intended as a starting point for implementing an OpenMP parallel version.
knapsack_01_brute, a C code which uses brute force to solve small versions of the 0/1 knapsack problem;
life_serial, a C code which computes a few steps of the evolution of John Conway's Game of Life, intended as a starting point for implementing a parallel version.
matrix_chain_brute, a C code which finds the cost of the most efficient ordering to use when multiplying a sequence of matrices, using brute force.
md, a C code which carries out a molecular dynamics simulation, and is intended as a starting point for implementing an OpenMP parallel version.
mxm_serial, a C code which sets up a matrix multiplication problem A=B*C, intended as a starting point for implementing a parallel version.
partition_brute, a C 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.
prime, a C code which counts the number of primes between 1 and N, intended as a starting point for the creation of a parallel version.
quad, a C code which approximates an integral using a quadrature rule, and is intended as a starting point for parallelization exercises.
quad2d, a C code which approximates an integral over a 2D region using a product quadrature rule, and is intended as a starting point for parallelization exercises.
satisfy_brute, a C code which uses brute force to find all assignments of values to a set of logical variables which make a complicated logical statement true.
search, a C code which searches the integers from A to B for a value J such that F(J) = C. this version of the program is intended as a starting point for a parallel approach.
subset_sum, a C code which seeks solutions of the subset sum problem, in which it is desired to find a subset of integers which has a given sum.
subset_sum_backtrack, a C code which uses backtracking to solve the subset sum problem, to find a subset of a set of integers which has a given sum.
tsp_brute, a C code which is given a city-to-city distance table, and solves a (small) traveling salesperson problem (TSP), using brute force.