Maximum and minimum of an array using minimum number of comparisons.txt

/*****************************************************************************
 Maximum and minimum of an array using minimum number of comparisons
*******************************************************************************/

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
class Pair
{
public:
  int min_element;
  int max_element;
  Pair ()
  {
         min_element=INT_MAX;
         max_element=INT_MIN;
  }
};
Pair obj;
class Pair calculate (int arr[], int n)
{
  for (int i = 0; i < n; i++)
    {
          if (arr[i] >= obj.max_element)
    	obj.max_element = arr[i];
          if (arr[i] <= obj.min_element)
    	obj.min_element = arr[i];
    }
  return obj;
}

int main ()
{
  int arr[] = { 1,2,4,5,-3,91  };
  int n = sizeof (arr) / sizeof (arr[0]);
  calculate (arr, n);
  cout << "Maximum element in the array " << obj.max_element << endl;
  cout << "Minimum element in the array " << obj.min_element << endl;
  return 0;
}