diff options
| author | Mike Vink <mike1994vink@gmail.com> | 2023-05-07 11:56:39 +0200 |
|---|---|---|
| committer | Mike Vink <mike1994vink@gmail.com> | 2023-05-07 11:56:39 +0200 |
| commit | ff2fe157be4009d111935deb9c0b85d358e99993 (patch) | |
| tree | 62fa055c586312d847de4bb21ba5084467cbb8fd /coding-exercises | |
| parent | 80704db7698b0dd0f8e373448d6221bd4c974ebe (diff) | |
fixup
Diffstat (limited to 'coding-exercises')
| -rw-r--r-- | coding-exercises/2/87.rkt | 4 |
1 files changed, 3 insertions, 1 deletions
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. |