input: Write a function to find the longest contiguous sequence of increasing numbers within a given array. 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, 5, 6]) == [1, 2, 3, 4, 5, 6]
  assert find_longest_increasing_sequence([2, 1, 3, 2, 4, 3, 5]) == [1, 3, 2, 4, 3, 5]
  assert find_longest_increasing_sequence([]) == []
output: if not nums:
      return []
  
  longest_seq = []
  current_seq = [nums[0]]
  
  for i in range(1, len(nums)):
      if nums[i] > nums[i - 1]:
          current_seq.append(nums[i])
      else:
          if len(current_seq) > len(longest_seq):
              longest_seq = current_seq
          current_seq = [nums[i]]
  
  if len(current_seq) > len(longest_seq):
      longest_seq = current_seq
  
  return longest_seq