下面我们给出Floyd-Steinberg算法的源代码。有一点要说明，我们原来介绍的程序都是先开一个char类型的缓冲区，用来存储新图数据，但在这个算法中，因为e有可能是负数，为了防止得到的值超出char能表示的范围，我们使用了一个int类型的缓冲区存储新值。另外，当按从左到右，从上到下的顺序处理象素时，处理过的象素以后不会再用到了，所以用这个int类型的缓冲区存储新值是可行的。全部象素处理完后，再将这些值拷贝到char类型的缓冲区去。-Below we give Floyd-Steinberg algorithm source code. One thing to note, our original procedures described are the first to open a buffer of type char is used to store the new map data, but in this algorithm, since e may be negative, in order to prevent the resulting value exceeds the char can be expressed range, we used a type int buffer to store the new value. In addition, when left to right, top to bottom in the order processing pixel, the processed pixel will be no longer used, so use this type int buffer to store the new value is feasible. All pixels dealt with, then these values ​ ​ are copied into the buffer to the char type.