Add example source for detecting signedness of playfield cells.
Chris Pressey
3 years ago

87 | 87 | | [selflist.bf](selflist.bf) | CC0 | Dmitry M Litvinov | 2/21/96 | A self-reproducing Befunge program, 13x4. |

88 | 88 | | [serp.bf](serp.bf) | | Kevin Vigor | 4/9/97 | Generates and prints a Serpinsky triangle, a simple type of fractal. Since the resolution is 20x30, the detail of the fractal isn't really visible, but hey, what can you do? |

89 | 89 | | [serp2.bf](serp2.bf) | | Kevin Vigor | 4/10/97 | Improved Serpinsky Triangle generator. |

90 | | [signdpfc.bf](signdpfc.bf) | CC0 | Chris Pressey | 10/4/118 | Prints "S" if your `bef` was compiled with a compiler that treats C's bare `char` type (and thus playfield cells) as signed chars, "U" if unsigned chars. Neither choice is normatively specified, but signed playfield cells are by far more common, and many consider it the de facto standard. | |

90 | 91 | | [sinus.bf](sinus.bf) | CC0 | Dmitry M Litvinov | 12/1/96 | Program to generate sine wave patterns. Based on cos(a+b)=cos(a)\*cos(b)-sin(a)\*sin(b) and sin(a+b)=sin(a)\*cos(b)+cos(a)\*sin(b). sin and cos values are kept in one stack cell = abs(sin) \* 2\^16 + abs(cos). |

91 | 92 | | [sort.bf](sort.bf) | | Kalyna Zazelenchuk | 9/5/93 | Same as anagram.bf, except sorts the letters of your word in ascending order. |

92 | 93 | | [surprise.bf](surprise.bf) | | Timothy Howe | 11/26/96 | A big surprise. |