[Data Structure learning] c ++ realize SM algorithm

int result[2];
int* SM(int* A, int n) {
 int max, min;

 max = min = A[0];

 for (int I =. 1; I <n-; I ++) {
  IF (A [I]> max) {
   max = A [I];
  }
  IF (A [I] <min) {
   min = A [I];
  }
 }
 // traversal and compare the

 result[0] = min;
 result[1] = max;
 return result;

 // pointer passed by the maximum and minimum
}