C中的频率直方图

Question

有人可以给我一个关于直方图伪代码是什么样子的提示吗？

Answer 1

How to structure and fill a histogram?

Trivial case is just a count per bin:

/* needs error checking, badly */
int *buildHist(int bins, double min, double max, int n, double *data){
   double *hist=malloc(bins*sizeof(int));
   if (hist == NULL) return hist;
   for (int i=0; i<n; ++i){
      int bin=int( (data[i]-min)/((max-min)/(bins)) );
      if ( (bin>=0) && (bin<n) ) hist[bin]++;
   }
   return hist;
}

For a weighted histogram, the array must be of floating point type.

With more data (over- and under-flow counts, accumulated statistics...or even to keep the limits in the same place as the count), use a structure that includes the array.

Incremental filling is often desired, but should be obvious from here.

Output depends a great deal on what display technology you have at hand.

Answer 2

Well, you'd probably have a bunch of printf statements at the top for your headers to give some meaning to the data. Then maybe a line of dashes or equals or something to work as a separator.

Then below that, loop through an array with the values you wish to plot. One on each line.