Created
October 6, 2017 04:11
-
-
Save annibuliful/42822a6343c3320ac468f70ec1f4d6ce to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
int mode(int a[],int n) { | |
int maxv = 0, maxc = 0, i, j; | |
for (i = 0; i < n; ++i) { | |
int count = 0; | |
for (j = 0; j < n; ++j) { | |
if (a[j] == a[i]) | |
++count; | |
} | |
if (count > maxc) { | |
maxc = count; | |
maxv = a[i]; | |
} | |
} | |
return maxv; | |
} | |
int main(){ | |
int input[500]; | |
int count = 0; | |
int i; | |
int sum = 0; | |
float avg; | |
printf("Input Number: "); | |
for(i = 0 ; i < 500 ; i++){ | |
scanf("%d" , &input[i]); | |
if(input[i] > 0){ | |
if(input[i] > 0 && input[i] < 101){ | |
sum += input[i]; | |
count += 1; | |
} | |
}else{ | |
break; | |
} | |
} | |
printf("Mode = %d \n" ,mode(input , count) ); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment