BinCounts

BinCounts[{x1,x2,}]
counts the number of elements whose values lie in successive integer bins.

BinCounts[{x1,x2,},dx]
counts the number of elements whose values lie in successive bins of width dx.

BinCounts[{x1,x2,},{xmin,xmax,dx}]
counts the number of in successive bins of width dx from to .

BinCounts[{x1,x2,},{{b1,b2,}}]
counts the number of in the intervals , , .

BinCounts[{{x1,y1,},{x2,y2,},},xbins,ybins,]
gives an array of counts where the first index corresponds to x bins, the second to y, and so on.

DetailsDetails

  • BinCounts drops elements whose values do not correspond to real numbers.
  • BinCounts[data,dx] takes the bin boundaries to be integer multiples of dx, with the first bin starting at Ceiling[Min[data]-dx,dx] and the last bin ending at Floor[Max[data]+dx,dx].
  • BinCounts[data] is equivalent to BinCounts[data,1].
  • BinCounts[data,{xmin,xmax}] is equivalent to BinCounts[data,{xmin,xmax,1}].
  • In BinCounts[data,{xmin,xmax,dx}], elements are counted in bin i when their values satisfy .
  • In the form BinCounts[data,{{b1,b2,}}], the at each end can be -Infinity and +Infinity.
  • If the do not form an increasing sequence, they are automatically sorted by BinCounts.
  • In BinCounts[data,{{b1,b2,}}], elements are counted in bin i when their values satisfy .
  • If data consists of length-n sublists, then n bin specifications must be given, and BinCounts[data,] yields an array of depth n.
  • BinCounts works with SparseArray objects.
Introduced in 2007
(6.0)