% Partial Digest algorithm
% The input digest L should be a ROW vector

function PartialDigest(L);

numsols=0;            % number of solutions found
L=sort(L);            % sort L, or just make sure it is indeed sorted.
width = L(end);       % width = largest entry in L
L = L(1:end-1);       % remove largest entry from L
X = [0,width];        % initialize X
[X,numsols] = Place(L,X,width,numsols); 

if numsols == 0
    disp('L is not a good PartialDigest Entry');
end