java-program/SortedPairSum.java at master · iamraghs/java-program · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
class SortedPairSum
{

  static boolean PairInSorted(int arr[], int n, int sum)
  {
    int i;
    for (i = 0; i < n - 1; i++)
            if (arr[i] > arr[i+1])
                break;

    int l = (i + 1) % n;
    int r = i;

    while (l != r) {
      if (arr[l] + arr[r] == sum) {

        return true;
      }

      if (arr[l] + arr[r] < sum) {
        l = (l + 1) % n;

      }
      if (arr[l] + arr[r] > sum) {
        r = (n + r - 1) % n;

      }

    }
    return false;

  }


  public static void main(String[] args) {
    int arr[] = {10,4,5,3,9};
    int sum = 29;
    int n = arr.length;

    if (PairInSorted(arr, n, sum)) {
      System.out.println("Array has two elements with sum " + sum);

    }
    else {
      System.out.println("Array doesnt have two elements with sum " + sum);
    }

  }
}