*hello i need again your help i have an examen in one day i need to
understand this programme : Define an anagr function taking as a parameter
a character string and returning the list of all anagrams of this string.
We are not concerned in this question of whether an anagram appears several
times or not in the result. We can do this in the following way: calculate
all anagrams starting with the first character of the given string, then
all those starting with the second character of the given string and so on.
For example, this function could give the results following: (anagr "abc")
returns' ("abc" "acb" "bac" "bca" "cab" "cba") and (anagr "aba") returns
("aba" "aab" "baa" "baa "" aab "" aba "). i have an idea : isolated the
first character then calculate the anagrams of the remaining strings then
with the second character and so on*
*But i don't know how make this exercise please*
--
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.
To view this discussion on the web visit
https://groups.google.com/d/msgid/racket-users/77a8130b-6950-4308-89fa-7b4d35267cba%40googlegroups.com.
