human
Count of right shifts for each array element to be in its sorted position | Function to find the right shifts required for each element to reach its sorted array position in A [ ].
Stores required number of shifts for each element.
If the element is at sorted position.
Otherwise.
Calculate right shift.
Print the respective shifts.
Driver Code"
How can the above be solved in Python?
assistant
#Here is code to count of right shifts for each array element to be in its sorted position and the other steps required.
 def findShifts ( A , N ) :
	shift = [ 0 for i in range ( N ) ]
	for i in range ( N ) :
		if ( i == A [ i ] - 1 ) :
			shift [ i ] = 0
		else :
			shift [ i ] = ( A [ i ] - 1 - i + N ) % N
	for i in range ( N ) :
		print ( shift [ i ] , end = " ▁ " )
if __name__ == ' _ _ main _ _ ' :
	arr = [ 1 , 4 , 3 , 2 , 5 ]
	N = len ( arr )
	findShifts ( arr , N )