Search Insert Position

public class Solution {
public int searchInsert(int[] nums, int target) {
if(nums.length == 0) return 0;
int low = 0;
int high = nums.length - 1;
int mid = (low + high) / 2;
while(low <= high) {
if(nums[mid] == target) return mid;
else if(nums[mid] > target) high = mid - 1;
else if(nums[mid] < target) low = mid + 1;
mid = (low + high) / 2;
}
return nums[mid] > target ? mid : mid + 1;
}
}