histc can be used on a floating point array to find the bin with the largest number of elements. However these bins are fixed, and for a fixed width of bin, might not be optimal.
a=[0 0.01 0.4 0.45 0.55 0.56 0.60]
histc(a,[0 0.5 1])
So the most frequent bin is [0, 0.5]. However, I am interested in a function that finds the range of at most 0.5 wide, with the most elements, so in this case [0.4, 0.6] which contains 5 elements. Does anybody know an elegant way of doing this?