Binary Search in iterative way

BinarySearchIterative.java

public class BinarySearchIterative {
	public static int search(int[] arr, int num) {
		int start = 0;
		int end = arr.length - 1;
		
		while (true) {
			if (end - start == 1) {
				if (arr[start] == num) {
					return start;
				} else if (arr[end] == num) {
					return end;
				} else {
					return -1;
				}
			} else {
				int mid = (start + end) / 2;
				
				if (arr[mid] == num) {
					return mid;
				} else {
					if (arr[mid] < num) {
						start = mid;
					} else {
						end = mid - 1;
					}
				}
			}
		}
	}
}