largest number of blocks
조회 수: 2 (최근 30일)
이전 댓글 표시
if i have v= 1:1:20 and its value are, a=[3,6,9,3,7,12,4,62,3,8,8,9,8,4,8,2,8,3,3,3] respectively.
Within the range of the minimum and maximum value of these a's, number of bins of equal width are set up.
then how to count The number of 'v' with a's within each bin and the bin with the largest number of 'v' .
댓글 수: 4
José-Luis
2013년 2월 1일
It is just an impression. If I have to analyze it, I would say it sounds like homework because of the way the question is phrased. But even then, it is always a good idea to show what you have actually tried, instead of asking people to give you an answer.
답변 (1개)
Jan
2013년 2월 1일
You need sort or min & max to get the range of the input, linspace for equally distributed bins and histc for counting and locating the related bin index.
댓글 수: 0
참고 항목
카테고리
Help Center 및 File Exchange에서 Time-Frequency Analysis에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!