Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2006
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2006

[Date Index] [Thread Index] [Author Index]

Search the Archive

Word permutations - frustrated by lists.

  • To: mathgroup at smc.vnet.net
  • Subject: [mg71693] Word permutations - frustrated by lists.
  • From: "wooks" <wookiz at hotmail.com>
  • Date: Sun, 26 Nov 2006 05:49:33 -0500 (EST)

Hello. Am relatively new with Mathematica.

I seem to have a general problem with results that look right but for
embedded lists. Here is an example of my problem. This is supposed to
be a algorithm to generate all permutations of a string. T

Clear[arrangements]
arrangements[str_String /; StringLength[str] == 1] := {str};
arrangements[str_String] := (Prepend[arrangements[StringJoin[
    Rest[#]]]], First[#]) & /@
       NestList[RotateRight, Characters[str], StringLength[str] - 1];
arrangements["dear"]

PS This is not homework. I'm rewriting some examples from another
programming book as as practice  for Mathematica.


  • Prev by Date: Simplify question
  • Next by Date: Re: Nonlinear Regression
  • Previous by thread: Re: Simplify question
  • Next by thread: Re: Word permutations - frustrated by lists.