I'm working in C with a stream of data. Basically I receive a column array of 6 elements every n milliseconds. I would like to compute the max value for each row of data.

To make this clear this is how my data looks like (this is a toy example, actually I'll have thousand of columns acquired):

```
[6] [-10] [5]
[1] [5]   [3]
[5] [30]  [10]
[2] [-10] [0]
[-2][5]   [10]
[-5][0]   [1]

```

So basically (as I said) I receive a column of data every n milliseconds, and I want to compute the max and min value row-wise. So in my previous example my result would be:

```
max_values=[6,5,30,2,10,1]
min_values=[-10,1,5,-10,-2,-5]

```

I want to point out that I have no access to the full matrix, I can only work over single columns of 6 elements that I receive every n milliseconds.

This is my simple code algorithm so far (I'm omitting the whole code since it's part of a bigger project):

```
 for(int i=0;i<6;i++){
        if(input[i]>temp_max[i]){
            temp_max[i]=input[i];
        }
        if(input[i]<temp_min[i]){
            temp_min[i]=input[i];
        }

    }

```

Where `input`, `temp_max` and `temp_min` are all float arrays of dimension 6.
Basically my code executes this piece of code everytime a new input array is available and updates the maximum and minimum accordingly.

Since I'm interested in performance (this is going to run on an embedded system), is there any way to improve this part of the code? Calling a comparison for each single element of the 2 arrays doesn't seem the most smart idea.