Question

i need the help to fix thie problrm in this code ( The output is 0 0, which means both are not the same? The assignment has already stated the first 2 are considered the same.)

this is the question

••• E6.10Write a function

bool same_elements(int a[], int b[], int size)

that checks whether two arrays have the same elements in some order, with the same multiplicities. For example,

1 4 9 16 9 7 4 9 11

and

11 1 4 9 16 9 7 4 9

would be considered identical, but

1 4 9 16 9 7 4 9 11

and

11 11 7 9 16 4 1 4 9

would not. You will probably need one or more helper functions.

#include <iostream>

using namespace std;

bool same_elements(int a[], int b[], int size) 
{
    bool *temp = new bool[size], t;
    for (int i = 0; i < size; i++) 
    {
        temp[i] = false;
    }
    for (int i = 0; i < size; i++) 
    {
        t = false;
        for (int j = 0; j < size; j++) 
        {
            if (a[i] == b[j]) 
            {
                if (temp[j] == false) 
                {
                    temp[j] = true;
                    t = true;
                }
            }
        }
        if (t == false) 
        {
            return false;
        }
    }
    delete[] temp;
    return true;
}

int main() 
{
    int arr1[] = {1, 4, 9, 16, 9, 7, 4, 9, 11};
    int arr2[] = {11, 1, 4, 9, 16, 9, 7, 4, 9};
    int arr3[] = {11, 11, 7, 9, 16, 4, 1, 4, 9};

    cout << same_elements(arr1, arr2, 9) << endl;
    cout << same_elements(arr1, arr3, 9) << endl;
    return 0;
} 

Answer 1

Thanks for the question.
Here is the completed code for this problem. Comments are included so that you understand whats going on. Let me know if you have any doubts or if you need anything to change.
Thank You !!
========================================================================================

#include <iostream>

using namespace std;

// create a copy of the array without altering the contents of the original array
void populateArray(int *sorted, const int *actual, int size){
   for(int i=0;i<size;i++)
   *(sorted+i)=*(actual+i);
}

// sort the array using bubble sort() algorithm
void sortArray(int *sorted, int size){
   int i, j;
    for (i = 0; i < size-1; i++)   
// Last i elements are already in place
for (j = 0; j < size-i-1; j++){
    if (sorted[j] > sorted[j+1]) {
       int temp = sorted[j];
       sorted[j]=sorted[j+1];
       sorted[j+1]=temp;
           }
   }
}
// temp function to print the arrays
void printArray(int *arr, int size){
   for(int i=0;i<size;i++){
       cout<<arr[i]<<" ";
   }
   cout<<endl;
  
}
bool same_elements(int a[], int b[], int size) {
   int *sorted_a= new int[size]; // create a temporary array for a
   int *sorted_b= new int[size]; // create a temporary array for a
   populateArray(sorted_a,a,size); // populate the new array with elements in a
   populateArray(sorted_b,b,size); // populate the new array with elements in b
   sortArray(sorted_a,size); // sort the array
   sortArray(sorted_b,size); // sort the array
   printArray(sorted_a,size);printArray(sorted_b,size); // comment this line
   // iterate each element in the two sorted arrays to see if they match
   for(int i=0;i<size;i++){
       // if the values at a particular index mistmatches return false immediately
       if(*(sorted_a+i)!=*(sorted_b+i)){
           return false;
       }
   }
   // if all check passes return true
   return true;
}

int main()
{
int arr1[] = {1, 4, 9, 16, 9, 7, 4, 9, 11};
int arr2[] = {11, 1, 4, 9, 16, 9, 7, 4, 9};
int arr3[] = {11, 11, 7, 9, 16, 4, 1, 4, 9};

cout <<boolalpha<< same_elements(arr1, arr2, 9) << endl;
cout <<boolalpha<< same_elements(arr1, arr3, 9) << endl;
return 0;
}

========================================================================================

sameElements.cpp populateArray (sorted_a,a, size); // populate the new array with elements in a populateArray (sorted_b,b,size); // populate the new array with elements in b sortArray (sorted a,size); /I sort the array sortArray (sorted b,size); /I sort the array printArray(sorted_a,size);printArray (sorted_b,size); // comment this line // iterate each element in the two sorted arrays to see if they match for(int i-0;i<size;i++)\ // if the values at a particular index mistmatches return false immediately if (* (sorted-a+1) !-* (sorted-bri)) { 36 37 38 40 41 42 43 return false; 45 CAUsers\UserlDocumentslsameElements.exe 46 //if all check passes return true 1 44 7 999 11 16 48 return true; rue 49 1 44 7 999 11 16 50 51 int main false 52 int arr11, 4, 9, 16, 9, 7, 4, 9, 113; int arr2[] = {11, 1, 4, 9, 16, 9, 7, 4, 9); int arr3]111, 11, 7, 9, 16, 4, 1, 4, 9}; 53 54 Process exited after 0.1198 seconds with return val 56 cout <<boolalpha<< same elements (arrl, arr2, 9) << endl; cout <<boolalpha<< same elements(arr1, arr3, 9) << endl; return 0; Press any key to continue .. . 58 59 60 es dlh Compile Log DebugFind Results Close Compilation results. . . -Errors : 0 - Warnings: 0 - Output Filename: C:\Users\User\Documents\sameElements.exe - Output Size: 1.83426856994629 MiB - Compilation Time 1.03s