input: Write a python function to find the longest contiguous increasing subsequence.
  assert long_increasing_subsequence([3, 6, 9, 1, 2, 3, 4, 5]) == 5
  assert long_increasing_subsequence([10, 22, 9, 33, 21, 50, 41, 60, 80]) == 6
  assert long_increasing_subsequence([1, 2, 3, 4, 5]) == 5
  assert long_increasing_subsequence([5, 4, 3, 2, 1]) == 1
output: def long_increasing_subsequence(arr):
      if not arr:
          return 0
  
      max_length = 1
      current_length = 1
  
      for i in range(1, arr.length):
          if arr[i] > arr[i - 1]:
              current_length += 1
              max_length = max(max_length, current_length)
          else:
              current_length = 1
  
      return max_length