Find the odd appearing element in O(Log n) time

04 Jun 2019

void search(int arr[], int low, int high)
{
	if (low > high)
	{
		return;
	}
	if (low == high)
	{
		System.out.printf("The required element is %d ", arr[low]);
		return;
	}

	int mid = (low + high) / 2;

	if (mid % 2 == 0)
	{
		if (arr[mid] == arr[mid + 1])
		{
			search(arr, mid + 2, high);
		}
		else
		{
			search(arr, low, mid);
		}
	}
	else
	{
		if (arr[mid] == arr[mid - 1])
		{
			search(arr, mid + 1, high);
		}
		else
		{
			search(arr, low, mid - 1);
		}
	}
}