chensheng@biheap.com:~$

Find a pair with the given difference

boolean findPair(int arr[], int n)
{
	int size = arr.length;

	int i = 0, j = 1;

	while (i < size && j < size)
	{
		if (i != j && arr[j] - arr[i] == n)
		{
			System.out.print("Pair Found: " + "( " + arr[i] + ", " + arr[j] + " )");
			return true;
		}
		else if (arr[j] - arr[i] < n)
		{
			j++;
		}
		else
		{
			i++;
		}
	}

	System.out.print("No such pair");
	return false;
}