OpenEuphoria

Re: fill function

• Posted by Noah Smith <nhs6080 at UNIX.TAMU.EDU> Sep 20, 1998
• 612 views

That would be great.  I've been thinking about how to do it non-recursively
(my C friend says the recursion tends to cause the stack overflow).

thanks
noah

>
>
>
> I wrote a non recursive fill algorithm and a recursive one.  The
> recursive one was a litte faster but they were both REALLY SLOW (about 9
> seconds to fill the whole screen)
>
> If you want the slow non-recursive one (ha) I'll post it.
>
> later,
>
> -Humberto Yeverino Jr.
>
> "I kick ass for the Lord."
>
> ***********************************************************
> Home Page:
>   http://www.engr.csufresno.edu/~humberto/Home.html
>
> Ti Page:
>   http://www.engr.csufresno.edu/~humberto/tex.html
>
> z80 Source Page:
>   http://www.engr.csufresno.edu/~humberto/z80source.html
>
> Official Tyrant Home Page:
>   http://www.engr.csufresno.edu/~humberto/tyrant.html
>
> E-mail:
>   humberto at engr.csufresno.edu
> ***********************************************************
>