input: Write a function to check whether the given list of numbers are sorted in ascending order or not. If the list contains more than one duplicate of the same number, the function should return False. The function assumes no negative numbers and only integers.
  assert is_sorted([5]) == True
  assert is_sorted([1, 2, 3, 4, 5]) == True
  assert is_sorted([1, 3, 2, 4, 5]) == False
  assert is_sorted([1, 2, 3, 4, 5, 6]) == True
  assert is_sorted([1, 2, 3, 4, 5, 6, 7]) == True
  assert is_sorted([1, 3, 2, 4, 5, 6, 7]) == False
  assert is_sorted([]) == True
  assert is_sorted([1]) == True
  assert is_sorted([3, 2, 1]) == False
  assert is_sorted([1, 2, 2, 2, 3, 4]) == False
  assert is_sorted([1, 2, 3, 3, 3, 4]) == False
  assert is_sorted([1, 2, 2, 3, 3, 4]) == True
  assert is_sorted([1, 2, 3, 4]) == True
  
output: def is_sorted(nums):
      for i in range(len(nums) - 1):
          if nums[i] > nums[i + 1] or nums[i] == nums[i + 1]:
              return False
      return True