Circular lists - 26 letters

S

sln

I need to permute the 26,25,24,... letters of the alphabet.
How many words can I make with that? Will it take much memory?
How much ram do I need, how long will it take?
Do I need circular lists?

sln
 
S

smallpond

I need to permute the 26,25,24,... letters of the alphabet.
How many words can I make with that? Will it take much memory?
How much ram do I need, how long will it take?
Do I need circular lists?

sln

See: Math::Counting::bperm
 
J

Jim Gibson

I need to permute the 26,25,24,... letters of the alphabet.

Which alphabet? There are 26 letters in the English alphabet. You can
get an alphabet consisting of 25 letters by eliminating one letter from
the English alphabet. There are 26 ways to do that. You can eliminate 2
letters to get a 24-letter alphabet; there are 26*25 ways to do that.

Given N distinct letters, there are N! permutations formed by selecting
N letters from the set in order. N! = N * (N-1) * (N-2) * ... * 3 * 2 *
1 (but you knew that).

Given N distinct letters, there are N!/(N-M)! different ways to select
M letters in order from N distinct letters (M < N).

How many words can I make with that?

Every word in the English language that does not have repeated letters,
and then some! What is your definition of a "word".
Will it take much memory?

Not if you generate the permutations one-at-a-time. See, for example,
'perldoc -q permute'
How much ram do I need,

Not much (see above).
how long will it take?

A very long time. Enough time to generate

26! + 26! + (26!/2!) + (26!/3!) + (26!/4!) + . . . + (26*25) + 26 + 1

permutations ( or thereabouts -- my math might be off a little). Since
26! is 4.0329E26, you will need about 10**13 years assuming you can
generate and process 1,000,000 permutations per second.
Do I need circular lists?

No.
 
S

sln

Which alphabet? There are 26 letters in the English alphabet. You can
get an alphabet consisting of 25 letters by eliminating one letter from
the English alphabet. There are 26 ways to do that. You can eliminate 2
letters to get a 24-letter alphabet; there are 26*25 ways to do that.

Given N distinct letters, there are N! permutations formed by selecting
N letters from the set in order. N! = N * (N-1) * (N-2) * ... * 3 * 2 *
1 (but you knew that).

Given N distinct letters, there are N!/(N-M)! different ways to select
M letters in order from N distinct letters (M < N).



Every word in the English language that does not have repeated letters,
and then some! What is your definition of a "word".


Not if you generate the permutations one-at-a-time. See, for example,
'perldoc -q permute'


Not much (see above).


A very long time. Enough time to generate

26! + 26! + (26!/2!) + (26!/3!) + (26!/4!) + . . . + (26*25) + 26 + 1

permutations ( or thereabouts -- my math might be off a little). Since
26! is 4.0329E26, you will need about 10**13 years assuming you can
generate and process 1,000,000 permutations per second.


No.

Total utteral hogwash, to even reply is ignorance personified!!

sln
 

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Members online

Forum statistics

Threads
473,744
Messages
2,569,484
Members
44,903
Latest member
orderPeak8CBDGummies

Latest Threads

Top