Question

# Given a sorted array A with distinct values which has been rotated r times to the...

Given a sorted array A with distinct values which has been rotated r times to the left. Find r in least possible time. Provide python source code, time complexity, and pseudocode.

Input: The sorted array ? that has been rotated r times to the left.

Output: The value and ?.

``````arr = [1, 2, 3, 4, 5];
#n determine the number of times an array should be rotated
n = 3;

#Displays original array
print("Original array: ");
for i in range(0, len(arr)):
print(arr[i]),

#Rotate the given array by n times toward left
for i in range(0, n):
#Stores the first element of the array
first = arr[0];

for j in range(0, len(arr)-1):
#Shift element of array by one
arr[j] = arr[j+1];

#First element of array will be added to the end
arr[len(arr)-1] = first;

print();

#Displays resulting array after rotation
print("Array after",n ,"left rotation: " );
for i in range(0, len(arr)):
print(arr[i]),    ``````

Time Complexity :- O(n);

#### Earn Coins

Coins can be redeemed for fabulous gifts.