How did you implement procedure part many years ago? Things may depend on what you want to do with the partitions. Do you want the whole list at once, or would a stream or generator be more appropriate? If you want I can send you a stream-version, but it is in a bad style. It has docs made with scribble. Jos
-----Original Message----- From: racket-users@googlegroups.com [mailto:racket-users@googlegroups.com] On Behalf Of Iain Gray Sent: jueves, 09 de noviembre de 2017 11:17 To: Racket Users Subject: [racket-users] numerical partitions Many years ago (r5rs days) I asked for help in partitioning numbers i.e. (part 4) returns ((4) (3 1) (2 2) (2 1 1) (1 1 1 1)) where the order of solutions is not important. Is it more efficient to implement using Racket's iteration macros? Any help would be appreciated. Iain -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout. -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
