From c6dc49f873ed16e9d0796b58a91a74089590e4ea Mon Sep 17 00:00:00 2001 From: Masaya Tojo Date: Fri, 23 Aug 2024 01:29:50 +0900 Subject: Add comments to describe the algorithm used in accel-asc procedure --- integer-partition/accel-asc.scm | 2 ++ 1 file changed, 2 insertions(+) diff --git a/integer-partition/accel-asc.scm b/integer-partition/accel-asc.scm index 870cb0b..fcb21b2 100644 --- a/integer-partition/accel-asc.scm +++ b/integer-partition/accel-asc.scm @@ -32,6 +32,8 @@ (loop)) (if #f #f))))))) (begin + ;; This is a Scheme implementation of Jerome Kelleher's algorithm for generating integer paritions. + ;; See: https://jeromekelleher.net/category/combinatorics.html (define (accel-asc n) (accel-asc* n vector-copy)) -- cgit v1.2.3