# SymPy | Permutation.rank_nonlex() in Python

Permutation.rank_nonlex() : rank_nonlex() is a sympy Python library function that returns the rank of non lexicographical permutation.

Syntax : sympy.combinatorics.permutations.Permutation.rank_nonlex()

Return : rank of non lexicographical permutation.

Code #1 : rank_nonlex() Example

 `# Python code explaining ` `# SymPy.Permutation.rank_nonlex() ` ` `  `# importing SymPy libraries ` `from` `sympy.combinatorics.partitions ``import` `Partition ` `from` `sympy.combinatorics.permutations ``import` `Permutation ` ` `  `# Using from  ` `# sympy.combinatorics.permutations.Permutation.rank_nonlex() method  ` ` `  `# creating Permutation ` `a ``=` `Permutation([[``2``, ``0``], [``3``, ``1``]]) ` ` `  `b ``=` `Permutation([``1``, ``3``, ``5``, ``4``, ``2``, ``0``]) ` ` `  ` `  `print` `(``"Permutation a - rank_nonlex form : "``, a.rank_nonlex()) ` `print` `(``"Permutation b - rank_nonlex form : "``, b.rank_nonlex()) `

Output :

Permutation a – rank_nonlex form : 13
Permutation b – rank_nonlex form : 72

Code #2 : rank_nonlex() Example – 2D Permutation

 `# Python code explaining ` `# SymPy.Permutation.rank_nonlex() ` ` `  `# importing SymPy libraries ` `from` `sympy.combinatorics.partitions ``import` `Partition ` `from` `sympy.combinatorics.permutations ``import` `Permutation ` ` `  `# Using from sympy.combinatorics.permutations.Permutation.rank_nonlex() method  ` ` `  `# creating Permutation ` `a ``=` `Permutation([[``2``, ``4``, ``0``],  ` `                 ``[``3``, ``1``, ``2``], ` `                 ``[``1``, ``5``, ``6``]]) ` ` `  ` `  `print` `(``"Permutation a - rank_nonlex form : "``, a.rank_nonlex()) `

Output :

Permutation a – rank_nonlex form : 218

My Personal Notes arrow_drop_up Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.