bindex.m

BINDEX solves the binning problem.

Description

BINDEX solves the binning problem. (i.e. For any set of bins on the real line, and a set of points relative to those bins, determine the index of the bin each point falls in.) There are several good algorithms available for this problem, so BINDEX chooses the algorithm which is likely to perform best as a function of both the number of bins and the number of points to sort into the bins. For maximum flexibility, BINDEX allows the user to optionally specify the choice of algorithm.

• MATLAB release: MATLAB 5.2 (R10)

[sergiod dominguez]

good

[A B]

Thanks for this thoughtful function. M-Lint Code Check provides a few simple comments for this function which can probably be used to optimize it. So many years have passed since this function was first submitted, but I still don't know of any other that does the job!

[A B]

 

[Remus SEPP]

Excellent stuff - I don't understand why is so hard for Matlab people to implement something like this, or even more: some basic data manipulation functions.

[S T]

Thanks! This kind of function is very handy. I think Matlab people should think about including such a function.

[Jim DeWaters]

Only problem I have with this is that it uses recursion. No a problem for most but a big problem for me.

[Skynet]

The built-in function HISTC can also return bin indexes.