You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to Study-HTDP
Here is an interesting problem;
;; my-permutations : a-word num => list of words
;; where a-word is a list of letters and num an integer < = the
length of a-word; construct a list
;; of all permutations of num length words (an n choose k number)
;; Of course you can use (arrangements...) from 12.4.1
;; the solution is really pretty
mike
;; (my-permutations '(a b c) 2) => '((a b) (a c) (b c)) a simple
example.
mike
unread,
Jan 30, 2011, 3:57:38 PM1/30/11
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to Study-HTDP
Opps i am replying to myself; but i made a mistake
(my-permutations '(a b c) 2) => (apply-arrangements '((a b) (a c)
(b c)) ) will yield
the answer the interesting part is generating '((a b) (a c) (b c))
from '(a b c).
mike