iterative binary method

#include "stdafx.h"
#include <iostream>
#include <vector>
 
using namespace std;
 
 
 
int iterbsearch(vector<int> * data, int target) {
    int low = 0;
    int high = data->size() - 1;
    while (low != high) {
        int mid = (low + high) / 2;
        if (data->at(mid) == target) {
            return mid;
        }
        else if (data->at(mid) > target) {
            high = mid;
        }
        else {
            low = mid + 1;
        }
    }
    if (data->at(low) != target) {
        return -1;
    }
    else {
        return low;
    }
}
 
int findlowerbound(vector<int> * data, int target) {
    int low = 0;
    int high = data->size() - 1;
    int mid;
    while (low < high-1) {
        //cout << low << " " << high << endl;
        mid = (low + high) / 2;
        if (data->at(mid) == target) {
            return target;
        }
        else if (data->at(mid) > target) {
            high = mid;
        }
        else {
            low = mid;
        }
    }
    if (target < data->at(low)) {
        return -1;
    }
    else if (target > data->at(high)) {
        return data->at(data->size() - 1);
    }
    else {
        return data->at(low);
    }
}
 
int main() {
    vector<int> v1 = { 1,2,4,5,6,8,9,11,13 };
    cout << findlowerbound(&v1,12) << endl;
    cout << iterbsearch(&v1, 11) << endl;
    while(1){}
    return 0;
}