I’m studying ruby (and I really love it even more than python) and I
want to do a little exercise.
I want to create an efficient module to generate every possible
anagrams of a word, of any given size…
I already done this in python, I want to see how can it be elegant in
I need a good permutation algorithm (this
works fine) and I’d like to use enumerators in the best and most
I also looked at callcc which is great for backtracking, could be used
in this case??
thanks for any help
A basic structure like that could be fine?
self.word <=> other.word
@word = word