Sum Pair in Sorted Rotated Array

sumPairRotatedArray.java

import java.io.*;
import java.util.*;

class Pivot 
{
    public void recursive(int a[], int low, int high, int sum) 
    {
        // already in sorted part sorted 
        if (a[high] > a[low]){
            System.out.println("Not rotated");
            return;
        }
        
        int length = a.length;
        int mid = -1;
        
        while(low <= high)
        {
            
            mid = (high + low)/2;
            // System.out.println(" Mid: " + mid);
            if (mid < a.length-1 && a[mid] > a[mid+1])
                break;
                //return (mid+1);
            
            if (a[low] <= a[mid])
                low = mid + 1;
            else
                high = mid - 1;
        };
        
        int max = mid;
        int min = (mid +1)%length;
        
        
        while(mid==max) {
            if((a[min] + a[max]) == sum) {
                System.out.println( " Sum Pair found :" + a[min] + "  " + a[max]);
                return;
            }
            if((a[min] + a[max]) > sum)
            {
                max = (max - 1 + length)%length;
            }else{
                min = (min + 1)%length;
            }
        };
        
        System.out.println( " No Result ");    
        return;
    }
    
    
    public static void main(String[] args) 
    {
        Pivot obj = new Pivot();
        int a[] = {6, 7, 16, 1, 2, 3, 4, 5};
        //int a[] = {15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14};
        int n = a.length;
        int sum = 22;
        obj.recursive(a, 0, n-1, sum);
    }
}