Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Semrush - keyword research tool

Create your online store today with Shopify

Turn ChatGPT, Claude, Gemini, And CoPilot Into Your Personal Assistant, Business Coach, Content Creator, And More

AFFILIATE MARKETING Your all-in-one performance engine Manage affiliates, creators, and customer referrals in one unified platform—turning every partnership into measurable growth

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Disclosure: My content contains affiliate links.

43,082 questions

55,955 answers

573 users

How to find if there is a pair in sorted array with sum equal to a given sum in Java

1 Answer

0 votes
public class MyClass {
    private static boolean isPairWithAGivenSum(int[] arr, int sum) {
        int size = arr.length;
        
    	for (int i = 0; i < size; i++) {
    		for (int j = 0; j < size; j++) {
    			if (i == j) {
    				continue;
    			}
    
    			if (arr[i] + arr[j] == sum) {
    				System.out.println("i = " + i + " j = " + j);
    				return true;
    			}
    
    			if (arr[i] + arr[j] > sum) {
    				break;
    			}
    		}
    	}
    
    	return false;
    }
    public static void main(String args[]) {
        int[] arr = {3, 5, 6, 8, 9, 12, 13, 15};
	    int sum = 17;

	    System.out.print(isPairWithAGivenSum(arr, sum));
    }
}






/*
run:

i = 1 j = 5
true

*/

 



answered Apr 22, 2023 by avibootz
...