input: Write a function to determine if it is possible to get an array sorted in non-decreasing order by performing any number of left shift operations on the given array. If it is possible return True else return False. If the given array is empty then return True.
  assert shift_left_sort([1, 2, 3, 4, 5])==True
  assert shift_left_sort([3, 4, 5, 1, 2])==True
  assert shift_left_sort([3, 5, 10, 1, 2])==True
  assert shift_left_sort([4, 3, 1, 2])==False
  assert shift_left_sort([3, 5, 4, 1, 2])==False
  assert shift_left_sort([])==True
output: def shift_left_sort(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