Min and Max value in array

[Benjamin]

This is how I did it:

_maxValue = _dataValues[0];
_minValue = _dataValues[0];


for(int i = 0; i<200; i++){
_maxValue = qMax(_maxValue, _dataValues[i]);
_minValue = qMin(_minValue, _dataValues[i]);
}

How can I know when max or min value is found, so that I can use index.

[Lykurg]

for(int i = 0; i<200; i++)

Hard coded size is dangerous!

_maxValue = _dataValues[0];
_minValue = _dataValues[0];
int _minValueIndex = 0;
int _maxValueIndex = 0;
for (int i=1; i<_dataValues.size(); i++)
{
  if (_dataValues[i] < _minValue)
  {
    _minValue = _dataValues[i];
    _minValueIndex = i;
  }
  if (_dataValues[i] > _maxValue)
  {
    _maxValue = _dataValues[i];
    _maxValueIndex = i;
  }
}

_maxValue = _dataValues[0];
_minValue = _dataValues[0];
int _minValueIndex = 0;
int _maxValueIndex = 0;
for (int i=1; i<_dataValues.size(); i++)
{
  if (_dataValues[i] < _minValue)
  {
    _minValue = _dataValues[i];
    _minValueIndex = i;
  }
  if (_dataValues[i] > _maxValue)
  {
    _maxValue = _dataValues[i];
    _maxValueIndex = i;
  }
}

To copy to clipboard, switch view to plain text mode 

(WITHOUT catching the case if there are two/more min/max values!)

[Benjamin]

Thank you for your replay.

I am wondering one thing, can this way of finding min and max values work with mixed positive and negative numbers?

[Lykurg]

I am wondering one thing, can this way of finding min and max values work with mixed positive and negative numbers?

Why not? (-1 > 2) or (2 > -1) are fine...