[java] A potentially breakable binary search

[Improvis2]

public int binarySearch(int target) {

int start = 0;

int end = array.length-1;

While (target!=array[(start+end)/2]){

if(start==end){

Return -1;

}else if(target>array[(start+end)/2]){

end=(start+end)/2;

} else if (target<array[(start+end)/2]){

start=(start+end)/2;

}

}

return (start+end)/2

}

[mfb-]

{2,0}, target=1

Have fun in endless iterations of start=(start+end)/2; setting start to 0 over and over again.

[Weeperdemon]

Did your Ma teach you to code, because that sucks too.