- Timestamp:
- 2016-06-18T19:30:12-07:00 (9 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/polynomial.lisp
r4548 r4551 345 345 (cons (car p) (slow-add (cdr p) (cdr q) order-fn add-fn)) 346 346 )))) 347 (t 347 (t ;(< (car p) (car q)) 348 348 (cons (car q) (slow-add p (cdr q) order-fn add-fn)) 349 349 )))))) … … 397 397 "Non-recursive version of SLOW-ADD. This version uses auxillary variable 398 398 RESULT which serves as a stack for the terms of the sum of P and Q. This version 399 is nearly twice as fast on some tests."399 is about as fast as SLOW-ADD, but it appears to use double the memory." 400 400 (loop 401 401 (cond
Note:
See TracChangeset
for help on using the changeset viewer.