function subset_sum_next_tests ( )

%*****************************************************************************80
%
%% subset_sum_next_tests() tests subset_sum_next_test().
%
%  Licensing:
%
%    This code is distributed under the MIT license.
%
%  Modified:
%
%    14 July 2017
%
%  Author:
%
%    John Burkardt
%
  fprintf ( 1, '\n' );
  fprintf ( 1, 'subset_sum_next_tests():\n' );
  fprintf ( 1, '  subset_sum_next_test() solves the subset sum problem\n' );
  fprintf ( 1, '  for specific values of S, N and V.\n' );
  
  s = 9;
  n = 5;
  v = [ 1; 2; 3; 5; 7 ];
  subset_sum_next_test ( s, n, v );
  
  s = 8;
  n = 9;
  v = [ 1; 2; 3; 4; 5; 6; 7; 8; 9 ];
  subset_sum_next_test ( s, n, v );
%
%  What happens with a repeated target?
%
  s = 8;
  n = 9;
  v = [ 1; 2; 3; 3; 5; 6; 7; 8; 9 ];
  subset_sum_next_test ( s, n, v );
%
%  What happens with a target that needs all the values?
%
  s = 18;
  n = 5;
  v = [ 1; 2; 3; 5; 7 ];
  subset_sum_next_test ( s, n, v );
%
%  A larger S.
%
  s = 5842;
  n = 10;
  v = [ 267; 493; 869; 961; 1000; 1153; 1246; 1598; 1766; 1922 ];
  subset_sum_next_test ( s, n, v );
 
  return
end
