Create an algorithm to find the longest continuous increasing subarray in a given array.
[1, 2, 3, 4, 5, 6]
Here's an algorithm to find the longest continuous increasing subarray in a given array:

```python
def longestContinuousIncreasingSubarray(arr):
    n = len(arr)
    result = 1 
    length = 1 
    for i in range(1, n):
        if arr[i] > arr[i-1]:
            length += 1
        else:
            result = max(result, length)
            length = 1
    return max(result, length)

arr = [1, 2, 3, 4, 5, 6]
print(longestContinuousIncreasingSubarray(arr))

```
### Output:
```6```

In the above example, the entire array is increasing continuously, hence the length of the longest continuous increasing subarray is 6.
Complete the following task based on the instruction and optional input provided.### Instruction:
Create an algorithm to find the longest continuous increasing subarray in a given array.

### Input:
[1, 2, 3, 4, 5, 6]

### Output:
Here's an algorithm to find the longest continuous increasing subarray in a given array:

```python
def longestContinuousIncreasingSubarray(arr):
    n = len(arr)
    result = 1 
    length = 1 
    for i in range(1, n):
        if arr[i] > arr[i-1]:
            length += 1
        else:
            result = max(result, length)
            length = 1
    return max(result, length)

arr = [1, 2, 3, 4, 5, 6]
print(longestContinuousIncreasingSubarray(arr))

```
### Output:
```6```

In the above example, the entire array is increasing continuously, hence the length of the longest continuous increasing subarray is 6.