In all the algorithms, always explain their correctness and analyze their complexity. The complexity should be as small as possible. A correct algorithm with large complexity, may not get full credit.

Consider an array of numbers. Give an algorithm that finds the maximum contiguous subarray that is increasing, Example: A = [1, 7, 2, 5, 4, 6, 8, 9, 3, 14, 16, 11, 30]. The maximum contiguous increasing sequence is 4, 6, 8, 9.