Factorial base numbers indexing permutations of a collection: Difference between revisions
Content added Content deleted
| Line 375: | Line 375: | ||
cardshoe = "A♠K♠Q♠J♠T♠9♠8♠7♠6♠5♠4♠3♠2♠A♥K♥Q♥J♥T♥9♥8♥7♥6♥5♥4♥3♥2♥A♦K♦Q♦J♦T♦9♦8♦7♦6♦5♦4♦3♦2♦A♣K♣Q♣J♣T♣9♣8♣7♣6♣5♣4♣3♣2♣" |
cardshoe = "A♠K♠Q♠J♠T♠9♠8♠7♠6♠5♠4♠3♠2♠A♥K♥Q♥J♥T♥9♥8♥7♥6♥5♥4♥3♥2♥A♦K♦Q♦J♦T♦9♦8♦7♦6♦5♦4♦3♦2♦A♣K♣Q♣J♣T♣9♣8♣7♣6♣5♣4♣3♣2♣" |
||
carr = split(cardshoe, "") |
carr = split(cardshoe, "") |
||
cards = map(x->join(x, ""),[carr[2*i+ |
cards = map(x->join(x, ""),[[carr[2*i+2]] for i in 0:51]) |
||
["10", carr[i+1][2]] : [carr[2*i+1], carr[2*i+2]] for i in 0:51]) |
|||
printcardshuffle(c, o) = (println(o); for i in 1:length(o) print(c[o[i] + 1]) end; println()) |
printcardshuffle(c, o) = (println(o); for i in 1:length(o) print(c[o[i] + 1]) end; println()) |
||