input: Write a function to determine if it is possible to get an array sorted in non-decreasing order by performing any number of cyclic shift operations on the given array. If it is possible return True else return False. If the given array is empty then return True.
  def is_cyclic_sort_possible(arr):
   if not arr:
    return True
   sorted_arr = sorted(arr)
   for _ in range(len(arr)):
    if arr == sorted_arr:
     return True
    arr = [arr[-1]] + arr[:-1]
   return False
  
  assert is_cyclic_sort_possible([3, 4, 5, 1, 2])==True
  assert is_cyclic_sort_possible([3, 5, 10, 1, 2])==True
  assert is_cyclic_sort_possible([4, 3, 1, 2])==False
  assert is_cyclic_sort_possible([3, 5, 4, 1, 2])==False
  assert is_cyclic_sort_possible([])==True
output: def is_cyclic_sort_possible(arr):
   if not arr:
    return True
   sorted_arr = sorted(arr)
   for _ in range(len(arr)):
    if arr == sorted_arr:
     return True
    arr = [arr[-1]] + arr[:-1]
   return False