/r/cs50/comments/6hjd59/pset3_binary_search_help/

helpers.c

     ... //more code above this line
     
         if(startPoint > endPoint){ //<-- startpoint is now larger than end point so I "break;" from the loop
                break;  //<-- prevents infinit loop
            }
    while(values[midPoint] != value); //<--- my sorting loop ends when it finds
    
    //return results
    if(startPoint > endPoint){ //<-- I know its false becuase startpoint is now larger than endpoint
        return false; //<-- so I return a false 
    }
    else{
        return true; //<-- im assuming midpoint value "is equal" (==) to value since its no longer looping
    }