partition set of numbers into subsets of equal size

equalSizeBins.erl

% produce a list, the elements of which are each lists of
% length 'Depth' of less forming sorted, equally sized bins
% of the numeric input list L
% the last bin will be of size (Depth rem length(L))
equal_size_bins (L,Depth) ->
  [tuple_to_list(X) || X <- equal_size_bins_sorted(lists:sort(L),Depth)].

equal_size_bins_sorted (L,Depth)
  when Depth >= length(L)
    -> [list_to_tuple(L)];
equal_size_bins_sorted (L,Depth) ->
  {NextBin,Remaining} = lists:split(Depth,L),
  [ list_to_tuple(NextBin) | equal_size_bins_sorted(Remaining,Depth)].