#CodeChallenge count how many times does N is contained in an array in C++

ElementCounter.cpp

#include <iostream>

int findFirstIndex(int* A, int n, int target, int position) {
  int low, high;
  low = 0;
  high = n - 1;
  int result = -1;
  while (low <= high) {
    int mid = low + (high - low) / 2;
    if (target == A[mid]) {
      if (position == 0) {
        high = mid - 1;
      } else {
       low = mid + 1;
      }
      result = mid;
    }
    else if (target < A[mid]) {
      high = mid - 1;
    } else {
      low = mid + 1;
    }
  }
  return result;
}

int main() {
  int arr[] = { 1, 2, 2, 2, 2, 2, 3, 4, 5 };
  int n = sizeof(arr) / sizeof(arr[0]);
  int target = 2;
  int leftIndex = findFirstIndex(arr, n, target, 0);
  int rightIndex = findFirstIndex(arr, n, target, 1);
  int times = rightIndex - leftIndex + 1;
  std::cout << target << "appaers " << times << std::endl;
}