input: Write a function to find the longest contiguous sequence of increasing numbers within an array. Return the longest sequence found. If the array is empty, return an empty list.
  
  assert find_longest_increasing_sequence([3, 2, 1, 4, 5, 6, 7, 8])==[4, 5, 6, 7, 8]
  assert find_longest_increasing_sequence([1, 2, 3, 4, 1, 2, 3, 4, 5])==[1, 2, 3, 4, 5]
  assert find_longest_increasing_sequence([10, 9, 8, 7, 6, 5])==[]
  assert find_longest_increasing_sequence([1])==[1]
  assert find_longest_increasing_sequence([])==[]
output: def find_longest_increasing_sequence(arr):
      if not arr:
          return []
      longest = []
      current = [arr[0]]
      for i in range(1, len(arr)):
          if arr[i] > arr[i-1]:
              current.append(arr[i])
          else:
              if len(current) > len(longest):
                  longest = current
              current = [arr[i]]
      if len(current) > len(longest):
          longest = current
      return longest