An array is **circularly sorted** if the elements are sorted in ascending order, but displaced, or rotated, by any number of steps. 

Complete the function/method that determines if the given array of integers is circularly sorted.


## Examples

These arrays are circularly sorted (`true`):
```
[2, 3, 4, 5, 0, 1]       -->  [0, 1] + [2, 3, 4, 5]
[4, 5, 6, 9, 1]          -->  [1] + [4, 5, 6, 9]
[10, 11, 6, 7, 9]        -->  [6, 7, 9] + [10, 11]
[1, 2, 3, 4, 5]          -->  [1, 2, 3, 4, 5]
[5, 7, 43, 987, -9, 0]   -->  [-9, 0] + [5, 7, 43, 987]
[1, 2, 3, 4, 1]          -->  [1] + [1, 2, 3, 4]
```

While these are not (`false`):
```
[4, 1, 2, 5]
[8, 7, 6, 5, 4, 3]
[6, 7, 4, 8]
[7, 6, 5, 4, 3, 2, 1]
```

Source: codewars | Difficulty: EASY
Tags: Sorting

Starter code: def circularly_sorted(arr):
	

Solutions:
def circularly_sorted(arr):
	m = arr.index(min(arr))
	return sorted(arr) == arr[m:] + arr[:m]


def circularly_sorted(arr):
	return sum((x > y for (x, y) in zip(arr, arr[1:] + [arr[0]]))) < 2


def circularly_sorted(arr):
	flag = 0
	for i in range(0, len(arr)):
		prev = arr[i - 1]
		if prev > arr[i]:
			flag += 1
	if flag > 1:
		return False
	else:
		return True


def circularly_sorted(lst):
	std = sorted(lst)
	i = len(std) - 1 - std[::-1].index(lst[0])
	return std[i:] + std[:i] == lst


def circularly_sorted(arr):
	i = len(arr) - arr[::-1].index(min(arr)) - 1
	return arr[i:] + arr[:i] == sorted(arr)


def circularly_sorted(arr):
	(N, jump) = (len(arr), False)
	for (i, n) in enumerate(arr):
		if n > arr[(i + 1) % N]:
			if jump:
				return False
			jump = True
	return True


def circularly_sorted(arr):
	diff = sum((arr[i] > arr[i + 1] for i in range(len(arr) - 1)))
	return diff == 1 and arr[-1] <= arr[0] or diff == 0


def circularly_sorted(arr):
	while arr[-1] <= arr[0]:
		arr = [arr.pop()] + arr
	return arr == sorted(arr)


def circularly_sorted(arr):
	temp = sorted(arr)
	for i in range(len(arr)):
		temp = temp[1:] + [temp[0]]
		if temp == arr:
			return 1
	return 0


def circularly_sorted(arr):
	smallest = arr.index(min(arr))
	if arr[smallest:] + arr[:smallest] == sorted(arr):
		return True
	else:
		return False