Factorial base numbers indexing permutations of a collection: Difference between revisions

It's not clear from the description what part of the four subtasks "your function" is supposed to handle. It's also unclear whether "generate all permutaions of 11 digits" means "generate all 479,001,600 11-digit factorial base numbers" or "generate all permutations of an 11-integer array using the 39,916,800 10-digit factorial base numbers." However, both of the latter are out of the question with AppleScript.

on FBNShuffle(|Ω|, fbn)

set astid to AppleScript's text item delimiters

set output to output as text

set AppleScript's text item delimiters to astid

{{output}}

0.0.0 -> 0123

0.0.1 -> 0132

4. With randomly generated 46.27.4.19.47.40.26.27.13.32.37.14.37.20.9.15.33.13.16.29.14.11.14.6.8.4.5.13.4.4.14.15.6.17.15.4.5.12.3.0.7.10.7.1.2.1.5.0.2.2.1

=={{header|F_Sharp|F#}}==

;The Functıons:

// Factorial base numbers indexing permutations of a collection

// Nigel Galloway: December 7th., 2018

let fN g=if n.[g]=Ω-g then n.[g]<-0; false else n.[g]<-n.[g]+1; true

seq{yield n; while [1..Ω]|>List.exists(fun g->fN (Ω-g)) do yield n}

;Re-create the table:

lN [|0;0;0|] |> Seq.iter (fun n->printfn "%A -> %A" n (lN2p n [|0;1;2;3|]));;

{{out}}

<pre>

;Shuffles:

let shoe==[|"A♠";"K♠";"Q♠";"J♠";"10♠";"9♠";"8♠";"7♠";"6♠";"5♠";"4♠";"3♠";"2♠";"A♥";"K♥";"Q♥";"J♥";"10♥";"9♥";"8♥";"7♥";"6♥";"5♥";"4♥";"3♥";"2♥";"A♦";"K♦";"Q♦";"J♦";"10♦";"9♦";"8♦";"7♦";"6♦";"5♦";"4♦";"3♦";"2♦";"A♣";"K♣";"Q♣";"J♣";"10♣";"9♣";"8♣";"7♣";"6♣";"5♣";"4♣";"3♣";"2♣";|]

//Random Shuffle

lN2p [|39;49;7;47;29;30;2;12;10;3;29;37;33;17;12;31;29;34;17;25;2;4;25;4;1;14;20;6;21;18;1;1;1;4;0;5;15;12;4;3;10;10;9;1;6;5;5;3;0;0;0|] shoe|>Array.iter (printf "%s ");printfn ""

lN2p [|51;48;16;22;3;0;19;34;29;1;36;30;12;32;12;29;30;26;14;21;8;12;1;3;10;4;7;17;6;21;8;12;15;15;13;15;7;3;12;11;9;5;5;6;6;3;4;0;3;2;1|] shoe|>Array.iter (printf "%s ");printfn ""

{{out}}

<pre>

;Comparıson wıth [[http://www.rosettacode.org/wiki/Permutations#F.23 Permutations(F#)]]:

let g=[|0..10|]

lC 10 |> Seq.map(fun n->lc2p n g) |> Seq.length

{{out}}

<pre>

=={{header|Factor}}==

math.parser math.ranges prettyprint qw random sequences

splitting ;

: main ( -- ) show-table show-shuffles show-random-shuffle ;

{{out}}

<pre>

=={{header|Go}}==

import (

}

fmt.Println()

{{out}}

Factoradic representation of integer numbers in canonical form (with trailing zero).

newtype Fact = Fact [Int]

fromFact (Fact ds) = foldr f 0 $ zip [1..] ds

where

<pre>λ> toFact 2021

Correspondence with permutations:

toPermutation (Fact ds) = go (reverse ds) [0.. length ds - 1]

where

permute :: [a] -> [Int] -> [a]

permute s p = case splitAt (length s - length p) s of

<pre>λ> toPermutation (fact [4,0,2,1,0])

Given tasks

putStrLn "number\tfactoradic\tpermutation"

mapM_ display [0..23]

\ A♥ K♥ Q♥ J♥ 10♥ 9♥ 8♥ 7♥ 6♥ 5♥ 4♥ 3♥ 2♥\

\ A♦ K♦ Q♦ J♦ 10♦ 9♦ 8♦ 7♦ 6♦ 5♦ 4♦ 3♦ 2♦\

<pre>λ> task1

=={{header|Julia}}==

listlist = Vector{Vector{Int}}()

count = 0

factbasenums()

0.0.0 -> [0, 1, 2, 3]

0.0.1 -> [0, 1, 3, 2]

=={{header|Nim}}==

# Representation of a factorial base number with N digits.

for i in 0..2:

echo "– for ", fbns[i], ':'

{{out}}

=={{header|Perl}}==

{{trans|Raku}}

use warnings;

use feature 'say';

say "\nGenerate a random shuffle";

say my $shoe = join '.', map { int rand($_) } reverse 0..$#omega;

{{out}}

<pre>Generate table

=={{header|Phix}}==

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">function</span> <span style="color: #000000;">fperm</span><span style="color: #0000FF;">(</span><span style="color: #004080;">sequence</span> <span style="color: #000000;">fbn</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">omega</span><span style="color: #0000FF;">)</span>

<span style="color: #000000;">show_cards</span><span style="color: #0000FF;">(</span><span style="color: #000000;">fperm</span><span style="color: #0000FF;">(</span><span style="color: #000000;">fbn51s</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">],</span><span style="color: #7060A8;">tagset</span><span style="color: #0000FF;">(</span><span style="color: #000000;">52</span><span style="color: #0000FF;">)))</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

{{out}}

<pre>

=={{header|Python}}==

"""

f.write("</pre>\n")

{{out}}

<pre>

(I have set my own tasks to illustrate the use of factorial base numbers with permutations as I do not find the assigned tasks particularly illuminating IMHO.)

[ dup 0 = iff [ drop 2 ] done

say '"lucentbiography" is permutation' cr

say '#' $ 'lucentbiography' $ 'uncopyrightable' permnum echo

'''Output:'''

Using my interpretation of the task instructions as shown on the [http://rosettacode.org/wiki/Talk:Factorial_base_numbers_indexing_permutations_of_a_collection#Mojibake_and_misspellings discussion page].

multi base (Int $n is copy, 'F', $length? is copy) {

put "\nSeems to me it would be easier to just say: Ω.pick(*).join";

{{out}}

<pre>Part 1: Generate table

{{libheader|Wren-math}}

{{libheader|Wren-fmt}}

import "/math" for Int

import "/fmt" for Fmt

perms = mapToPerms.call([fbn51])

for (d in perms[0]) System.write(cards[d])

{{out}}

=={{header|zkl}}==

omega=omega.copy(); // omega gonna be mutated

foreach m,g in ([0..].zip(num)){ if(g) omega.insert(m,omega.pop(m+g)) }

omega

{{out|Part 1, Generate permutation table}}

println("%d.%d.%d --> %s".fmt(a,b,c, fpermute(T(0,1,2,3),T(a,b,c)).concat()));

{{out}}

<pre style="height:35ex">

{{out|Part 3, Generate the given task shuffles}}

foreach s,c in ("\u2660 \u2665 \u2666 \u2663".split(),

"A K Q J 10 9 8 7 6 5 4 3 2".split()){ deck.append(c+s) }

"51.48.16.22.3.0.19.34.29.1.36.30.12.32.12.29.30.26.14.21.8.12.1.3.10.4.7.17.6.21.8.12.15.15.13.15.7.3.12.11.9.5.5.6.6.3.4.0.3.2.1")

.apply(fcn(s){ s.split(".").apply("toInt") });

{{out}}

<pre>

{{out|Part 4, Generate a random shuffle}}

{{out}}

<pre>