Question

C code that receives a list of integer numbers separated by space and terminated by EOF as input and output the mean of the non-duplicated elements with 2 decimal points precision. The algorithm should be at most O(n log n). In your write up, describe the pseudocode and the complexity

e.g 2 -2.5 3 2.5 3 EOF

output: 1.25

Note do not include anything other than <stdio.h>

Answer 1

Algo sumco file; . n= Take input from while (n!= EOF) { sumurn; natake input from file; ? point ("mean =%d", swm/mo: of elements); Il 17 e 8 Here, we are running a loop "n" tarations. We are calculating the som within that loop only. so, the time complexity is on) which is less than onlogn).

code:-

#include <stdio.h>
int main(void){
   int n,i;
   printf("Enter number of inputs:");
   scanf("%d",&n);
    float array[n],mean=0;
    printf("Enter inputs:");
    for (i=0;i<n;i++){
       scanf("%f",&array[i]);
       mean=mean+array[i];       //It won't matter if we include duplicate values too,the result will be same
    }
    printf("Result mean=%.2f",mean/n);
    return 0;
}

output:-

C:\Program Files (x86)\Dev-Cpp ConsolePauser.exe Enter number of inputs:5 Enter inputs:1.1 1.1 3.4 3.4 5 Result mean=2.80 Process exited normally. Press any key to continue ...

thank you