Link Details

Link 962551 thumbnail
User 225256 avatar

By mswatcher
via ericlippert.com
Submitted: Apr 30 2013 / 09:46

Last time on FAIC I showed how you could produce the mth permutation of n elements, where m is a number between zero and n!-1 that chooses from the n! possible permutations. There's a very interesting way to represent numbers that are always less than n! for a given n that I thought I might talk about today.
  • 3
  • 0
  • 87
  • 52

Add your comment


Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Upvoters (2)



Downvoters (0)



    Apache Hadoop
    Written by: Piotr Krewski
    Featured Refcardz: Top Refcardz:
    1. Play
    2. Akka
    3. Design Patterns
    4. OO JS
    5. Cont. Delivery
    1. Play
    2. Java Performance
    3. Akka
    4. REST
    5. Java