Question

How to find the largest pair sum in an unsorted array with C++

Answer 1

#include <iostream>
#include <climits>

int largest_sum(int arr[], int size) {
    if (size <= 1) {
        return -1;
    }
  
    int first, second; 
      
    first = second = INT_MIN; 
   
    for (int i = 0; i < size ; i ++) { 
        if (arr[i] > first) { 
            second = first; 
            first = arr[i]; 
        } 
        else if (arr[i] > second) { 
            second = arr[i]; 
        } 
    } 
     
    std::cout << first << " " << second;
    
    return first + second;
}
  
  
int main()
{
  int arr[] = {3, 5, 9, 8, -1, 4, 6, 5, 8, 0, 2};
  
  int size = sizeof(arr) / sizeof(arr[0]);
  
  std::cout << largest_sum(arr, size);
    
  return 0;
}
  
  
  
    
/*
run:
           
9, 8
17
           
*/

 

70+ SQL courses for beginners and professionals