Set up counter variables for positive, negative and zero values (npos, nneg, nzero). Set a temporary variable (currmin) for the minimum larger than the highest value expected (or max float or max integer), and set a temporary variable for the maximum (currmax) smaller than the smallest value exected. Then iterate through the array value by value in a for loop and do these checks:
* if the current array value is positive increment the positive counter by 1 (e.g. --> if array[index] > 0 then inc(npos))
* if the current array value is negative increment the negative counter by 1
* if the current array value is zero increment the zero counter by 1
* if the current array value is larger than the temporary maximum variable set that to the current array value (e.g. if array[index] > currmax then currmax := array[index])
* if the current array value is smaller than the temporary minimum variable set that to the current array value.
I will not post ready-to-use code here, because this question sounds like some homework assignment, and you only can learn coding by doing it yourself.