Your version works far better than my original, functional version. It can multiply 300 polynomials of degree 6 without issue. It's about 1/3 as fast as my dirty, mutable version, for numbers that great.
tk On Wed, May 02, 2012 at 11:09:02PM +0200, Jens Axel Søgaard wrote: > I believe the problem is the representation, you have chosen > for polynomials in the first program. > > I am interested in hearing if the following representation gives a > better results: > > #lang racket > (require (only-in srfi/1 span)) > > ;;; > ;;; Dense polynomials represented as lists. > ;;; > <snip> ____________________ Racket Users list: http://lists.racket-lang.org/users
