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

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

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

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,950 questions

51,892 answers

573 users

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

1 Answer

0 votes
#include <stdio.h>
#include <stdbool.h>
  
bool isPairWithSumEqualToAGivenSumExists(int arr[], int size, int sum) {
    for (int i = 0; i < size; i++) {
        for (int j = i + 1; j < size; j++) {
            if (i == j) {
                continue;
            }
  
            if (arr[i] + arr[j] == sum) {
                printf("i = %d j = %d\n", i, j);
                return true;
            }
  
            if (arr[i] + arr[j] > sum) {
                break;
            }
        }
    }
  
    return false;
}
  
int main()
{
    int arr[] = { 3, 5, 6, 8, 9, 12, 13, 15 };
    int sum = 17;
    int size = sizeof(arr) / sizeof(arr[0]);
  
    isPairWithSumEqualToAGivenSumExists(arr, size, sum) ? puts("true") : puts("false");
  
    return 0;
}
  
  
  
/*
run:
  
i = 1 j = 5
true
  
*/

 



answered Apr 22, 2023 by avibootz
edited Feb 14, 2024 by avibootz
...