LeetCode(35) Search Insert Position

[code]class Solution {
public:

    void search(vector<int> &nums, int index1, int index2, int target, int &index, bool &doHave) {

        if(index1 > index2)

            return;

        if(index1 == index2) {

            if(nums[index1] == target) {

                doHave = true;
                index = index1;

            }

            return;

        }

        int mid = index1 + (index2 - index1) / 2;
        if(nums[mid] == target) {

            doHave = true;
            index = mid;

            return;
        }

        if(nums[mid] > target)

            search(nums, index1, mid - 1, target, index, doHave);

        if(nums[mid] < target)

            search(nums, mid + 1, index2, target, index, doHave);
    }

    int searchInsert(vector<int>& nums, int target) {
        int index;
        bool doHave = false;

        search(nums, 0, nums.size() - 1, target, index, doHave);

        if(doHave == false) {

            int i = 0;
            for(; i < nums.size(); )
                if(nums[i] < target)

                    i++;

                else

                    break;

            return i;        

        }

        return index;

    }
};

[code]class Solution {
public:

    void search(vector<int> &nums, int index1, int index2, int target, int &index, bool &doHave) {

        if(index1 > index2)

            return;

        if(index1 == index2) {

            if(nums[index1] == target) {

                doHave = true;
                index = index1;

            }

            return;

        }

        int mid = index1 + (index2 - index1) / 2;
        if(nums[mid] == target) {

            doHave = true;
            index = mid;

            return;
        }

        if(nums[mid] > target)

            search(nums, index1, mid - 1, target, index, doHave);

        if(nums[mid] < target)

            search(nums, mid + 1, index2, target, index, doHave);
    }

    int searchInsert(vector<int>& nums, int target) {
        int index;
        bool doHave = false;

        //search(nums, 0, nums.size() - 1, target, index, doHave);

        int index1 = 0;
        int index2 = nums.size() - 1;

        while(index1 <= index2) {

            int mid = index1 + (index2 - index1) / 2;

            if(nums[mid] == target) {
                doHave = true;
                index = mid;
                break;
            }

             if(nums[mid] > target) {

                index2 = mid - 1;
                continue;
            }

            if(nums[mid] < target) {

                index1 = mid + 1;
                continue;

            }

        }

        if(doHave == false) {

            int i = 0;
            for(; i < nums.size(); )
                if(nums[i] < target)

                    i++;

                else

                    break;

            return i;        

        }

        return index;

    }
};