Skip to content
Related Articles

Related Articles

Python | SymPy Permutation.ascents() method
  • Last Updated : 26 Aug, 2019

Permutation.ascents() : ascents() is a sympy Python library function that returns the position of ascents in the permutation.
Ascents are the elements where a[i] < a[i+1]

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

Return : position of ascents in the permutation

Code #1 : ascents() Example




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

Output :



Permutation a – ascents form : [0, 2]
Permutation b – ascents form : [0, 1]

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




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

Output :

Permutation a – ascents form : [1, 2, 4]

 Attention geek! Strengthen your foundations with the Python Programming Foundation Course and learn the basics.  

To begin with, your interview preparations Enhance your Data Structures concepts with the Python DS Course. And to begin with your Machine Learning Journey, join the Machine Learning – Basic Level Course

My Personal Notes arrow_drop_up
Recommended Articles
Page :