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 elements within the array. If it is possible return True else return False. If the given array is empty then return True.
  assert cyclic_sort_possible([3, 4, 5, 1, 2])==True
  assert cyclic_sort_possible([3, 5, 10, 1, 2])==True
  assert cyclic_sort_possible([4, 3, 1, 2])==False
  assert cyclic_sort_possible([3, 5, 4, 1, 2])==False
  assert cyclic_sort_possible([])==True
output: def cyclic_sort_possible(arr):
      if not arr:
          return True
      n = len(arr)
      count = 0
      for i in range(n):
          if arr[i] > arr[(i + 1) % n]:
              count += 1
          if count > 1:
              return False
      return True