Question

22:217 learn-ap-southeast-1-prod-fleet02-xythos.s3-ap-southeast-1.am purse Code: CSCI1540 (2019-20, Term 1) Page 2 of 6 2. (20%) Write a program (file name: Q2.cpp) with a function of int distinct (int *p, int n); where the parameter pointer p is the base address of an array of size n. The function returns the number of distinct (unique) elements in the array. E.g., suppose array x has contents {1,6,4,6,1). Then the call distinct (x, 5) should return 3. (The three distinct elements are 1,6, 4.) Note: . What you write in the main() function is unimportant. It can contain code to test the required function. We shall grade only the required function. purse Code: CSC11540 (2019-20, Term 1) Page 3 of 6

Answer 1

Thanks for the question. Below is the code you will be needing. Let me know if you have any doubts or if you need anything to change.

If you are satisfied with the solution, please rate the answer.

Thank You !

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

#include <iostream>
using namespace std;

int distinct(int* p, int n){
  
   int *uniques = new int[n];
  
   int index =0;
  
   for(int i=0; i<n; i++){
      
       int num = *(p+i);
       bool exist=false;
       for(int k=0; k<index; k++){
           if(*(uniques+k)==num){
               exist=true;
               break;
           }
       }
      
       if(!exist){
           *(uniques+index++) = num;
       }
   }
   delete[] uniques;
   return index;
  
  
}

int main(){
  
   int p[] ={1,6,4,6,1,7,8,6,7,6,5,6,7,1,3,5,7,8,9,5,2,4,7,8,3};
   int n = sizeof(p)/sizeof(int);
  
   cout<<"Total unique elements: "<<distinct(p,n);
  
}

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

Q2.cpp 1 #include <iostream> 2 using namespace std; C:\UsersUser Documents\Q2.exe Total unique elements: 9 ---------- --------- --------- ---- Process exited after 0.2095 seconds with return value o Press any key to continue... 5 int distinct(int* p, int n){ 7 int *uniques = new int[n]; int index = 0; for(int i=0; i<n; i++){ int num = *(p+i); bool exist=false; for (int k=; k<index; k++) { if(*(uniques+k)==num) { exist=true; break; if(!exist) { *(uniques+index++) = num; delete[] uniques; return index; :: Compiler Resources dh Compile Log Debug Find Results - Errors: 0 Abort Compilation - Warnings: 0 - Output Filename: C:\Users\User\DoL - Output Size: 1.83295249938965 MiB Shorten compiler paths - Compilation Time: 1.333