function deepEqual(a, b) {
  // value comparison
  if (a === b) { return true };
  
  var propaCount = 0;
  var propbCount = 0;
  
  // object comparison
  if (typeof(a) == 'object' && typeof(b) == 'object' && a != null && b != null) {
    // count the properties in object a
    for (var prop in a) {
      propaCount += 1;
    }
    // starting comparing properties of b in a and recursively comparing the values
    for (var prop in b) {
      propbCount += 1;    
      if (!(prop in a) || !deepEqual(a[prop], b[prop])) {
        return false;  
      }
    }
  // if the object test fails
  } else {
    return false;
  }
  // to get it to work I have to include return true; here however don't understand why the recursive determination of true using the comparison at top of function changes to 'undefined' when returning back to the comparison initiating the call (using pythontutor)
}

#include <algorithm>

int MinBinarySearch(int Elem, int v[], int start, int end)
{
    // Calls to this function should do this inside an exception handler 
    // because this could definitely throw an exception. Of course your
    // solution can throw an exception too.
    return *std::min_element((v+start), (v+end+1));
}

int MinBinarySearch(int Elem, int v[], int start, int end)
{
    int middle, iMin=-1;
    if((start>end) && iMin==-1)
        return -1;
    middle=(start+end)/2;
    if(Elem==v[meio])
    {
        iMin=middle;
        return MinBinarySearch(Elem,v,start,middle-1);
    }
    if(Elem<v[middle])
        return MinBinarySearch(Elem,v, start, middle-1);
    else
        return MinBinarySearch(Elem,v,middle+1,end);
    return iMin;
}

#include <stdio.h>I

int MinBinarySearch(int Elem, int v[], int start, int end)
{
    int iMin=-1;
    do
    {
    if((start>end)&&(iMin==-1))
        return -1;
    int middle=(start+end)/2;
    if(Elem==v[middle])
    {
        iMin=middle;
        return MinBinarySearch(Elem,v,start,middle-1);
    }
    if(Elem<v[middle])
        return MinBinarySearch(Elem,v, start, middle-1);
    else
        return MinBinarySearch(Elem,v,middle+1,end);
        
    }while(start<=end);
    return iMin;
}


int main()
{
    int A[7]={2,4,10,10,10,18,20};
    int res= MinBinarySearch(10, A, 0, 6);
    printf("%d\n", res);




}