Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Rapid PHP 2018 15.5
IBDAC 6.4
Online Course Booking Script 1.3.3
Database Workbench Pro 5.6.4
Job Portal Script 1.3.2
The C# PDF Library 5.2
PostgreSQL Data Access Components 6.0
Virtual Data Access Components 11.0
HTMLPad 2018 15.5
WeBuilder 2018 15.5
SentiMask SDK Trial 2.0.0
Track Order For Magento 2 1.0.0
Calendar 365 For Dynamics CRM 4.0
Scimbo 1.2
Odoo Furnito Theme 1.0
Top Code
TdsPrinter 1.8
Top Rated
VisualNEO Web 2018.12.15
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
Getting <n>th permutation of a sequence 
File ID: 66739






Getting <n>th permutation of a sequence 
Download Getting <n>th permutation of a sequence http://code.activestate.com/recipes/496984-iterate-over-mp4-atoms/?in=lang-pythonReport Error Link
License: Freeware
Downloads: 5
Submit Rating:
Getting <n>th permutation of a sequence  Description
Description: This function, given a sequence and a number n as parameters, returns the <n>th permutation of the sequence (always as a list).

License: Freeware

Related: Algorithms

O/S:Windows

Downloads: 5



More Similar Code

Small function to generate every permutation of a given sequence. Works for lists and strings



This very simple function computes the n n-th roots of a given complex number. The attained complex roots can be plotted on a polar diagram.
It is more performante then
roots([1, zeros(1,n-1), -x]),
since it is based on very simple...



This function returns N point DFT samples of 2dw band of Fourier transform of a sequence. Typically, fft() returns N samples of Fourier transform ranging from 0 to 2pi. This function takes the N-point DFT samples and returns N-point samples...



Usage :
r = subfactorial(n) calculates the subfactorial of a non -negative integer (n) using the inclusion-exclusion principle.
The subfactorial can be written as,
!n = n! sum( (-1)^k / k! ), for k = 0 to n
!n :...



To quickly find the index of the first maximum item of a sequence.



This generator will sort only the requested part of a list. Useful for getting just the first few elements of a list and avoiding the overhead of sorting the whole thing.



While I have seen many permutation recipes on this site, there seems to be no recipe yet which shows how to generate the permutations of a "bag". A bag is like a set but can contain elements more than once.



n the bottom of a Stefan tube there is a quiescent liquid with a mixture of acetone (component 1) and methanol (component 2). Vapor that evaporates from this pool of liquid diffuses to the top of the tube. Air (component 3) keeps the mole...



It is very fast and simple file to display histogram of a 3D image
imhist3(I,n) n is the number of bins in the histogram
imhist3(X,map) X isindexed 3D image and map is colormap map



The following function creates a map of all members of a class, navigating ALL of the base classes in the correct order. This can be used for various purposes, like checking whether a certain method is defined anywhere in a class hierarchy.

User Review for Getting <n>th permutation of a sequence
- required fields
     

Please enter text on the image