Answered

Welcome to Westonci.ca, the ultimate question and answer platform. Get expert answers to your questions quickly and accurately. Explore comprehensive solutions to your questions from knowledgeable professionals across various fields on our platform. Connect with a community of professionals ready to help you find accurate solutions to your questions quickly and efficiently.

Write a function solution that, given an array A consisting of N integers, returns the number of fragements of A whose sum equals 0 (that is, pairs (p,q) such that P

Sagot :

Answer:

#include <iostream>

using namespace std;

void fragment(int arr[], int n){

   for (int i = 0; i < n; i++){

       for (int x = 0; x < n; x++){

           if (x != i && arr[i] + arr[x] == 0){

               cout<< arr[i] << " , " << arr[x];

           }

       }

   }

}

int main(){

   int n = 7;

   int myArr = {1, 2, -1, -2, 0, 0, 3};

   fragment(myArr, n);

}

Explanation:

The C++ source code defines an array called "myArr" in the main program and its array size n. The void function "fragment" prints out the pairs of the array whose sum equates to zero.

We hope you found this helpful. Feel free to come back anytime for more accurate answers and updated information. Thank you for visiting. Our goal is to provide the most accurate answers for all your informational needs. Come back soon. Your questions are important to us at Westonci.ca. Visit again for expert answers and reliable information.