C++

I am trying to build a template binary search function. I have the follwoing, but it keeps getting stuck in a continous loop. Can someone help me fix this code so that it runs.

#include #include #include

using namespace std;

template bool binarySearch(vector &a, T item) { int first = 0; int last = a.size() - 1;

cout << last; bool found = false; int midpoint = first + last/2;

while(first <= last && found != true){ if(a[midpoint] == item) { found = true; } else { if(item > midpoint) first = midpoint + 1; else last = midpoint - 1; } }

return found;

}

int main() { vector nums;

nums.push_back(2); nums.push_back(4); nums.push_back(6); nums.push_back(8); nums.push_back(10); nums.push_back(12); nums.push_back(14);

binarySearch(nums, 2); binarySearch(nums, 3);

return -1; }