From ff2fe157be4009d111935deb9c0b85d358e99993 Mon Sep 17 00:00:00 2001 From: Mike Vink Date: Sun, 7 May 2023 11:56:39 +0200 Subject: fixup --- coding-exercises/2/87.rkt | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) (limited to 'coding-exercises') diff --git a/coding-exercises/2/87.rkt b/coding-exercises/2/87.rkt index a8b1ed0..4a47e94 100644 --- a/coding-exercises/2/87.rkt +++ b/coding-exercises/2/87.rkt @@ -233,4 +233,6 @@ (display (sub test-poly1 test-poly2)))) ;; 89 -;; Dense polys are just lists where the length of the sublist until the term is the order of the term +;; First we made the polynomial package generic for sparse polys +;; Then we added dense polys as allowed types just lists where the length of the sublist until the term is the order of the term +;; When we do this, we can even put some heuristics to decide to save polys in the optimal format by scanning and reconstructing the term list during poly construction. -- cgit v1.2.3