binary_search_with_duplicates.cpp

#include <iostream>
#include <cassert>
#include <vector>
#include <cmath>


using std::vector;

int binary_search(const vector<int> &a, int x) {
  int left = 0, right = (int)a.size()-1;
  int result = -1;
  while (left <= right)
  {
    int mid = floor((right-left)/2 + left);
    if (x == a[mid])
    {
      result = mid;
      right = mid;
      if(mid == 0){
        return result;
      }
      if(mid == (int)a.size()-1){
        return result;
      }
      continue;
      //return mid;
    }
    else if (x < a[mid])
    {
      right = mid - 1;
    }
    else
    {
      left = mid + 1;
    }
  }
  return result;
}

int linear_search(const vector<int> &a, int x) {
  for (size_t i = 0; i < a.size(); ++i) {
    if (a[i] == x) return i;
  }
  return -1;
}

int main() {
  int n;
  std::cin >> n;
  vector<int> a(n);
  for (size_t i = 0; i < a.size(); i++) {
    std::cin >> a[i];
  }
  int m;
  std::cin >> m;
  vector<int> b(m);
  for (int i = 0; i < m; ++i) {
    std::cin >> b[i];
  }
  for (int i = 0; i < m; ++i) {
    //replace with the call to binary_search when implemented
    std::cout << linear_search(a, b[i]) << ' ';
  }
}