Last active
April 1, 2017 05:33
-
-
Save harshildarji/b753cb5b3c2455d34048 to your computer and use it in GitHub Desktop.
This code performs binning by mean and binning by boundary. Language used in this code is 'C'.
This file contains 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> | |
#include<conio.h> | |
#include<math.h> | |
void main() | |
{ | |
int a[100],**b,i,j,r,c,n,temp,k=0,sum,avg[10],l,h; | |
clrscr(); | |
printf("How many data? "); | |
scanf("%d",&n); | |
for(i=0;i<n;i++) | |
{ | |
a[i]= rand()%(100); | |
} | |
printf("\nGenerated Random Numbers:"); | |
for(i=0;i<n;i++) | |
{ | |
printf(" %d",a[i]); | |
} | |
printf("\n\nSorted Data:"); | |
for(i=0;i<n;i++) | |
{ | |
for(j=i+1;j<n;j++) | |
{ | |
if(a[i]>a[j]) | |
{ | |
temp=a[i]; | |
a[i]=a[j]; | |
a[j]=temp; | |
} | |
} | |
} | |
for(i=0;i<n;i++) | |
{ | |
printf(" %d",a[i]); | |
} | |
printf("\n\nHow many bins? "); | |
scanf("%d",&r); | |
c=n/r; | |
for(i=0;i<r;i++) | |
{ | |
b[i]=(int*)malloc(c*sizeof(int)); | |
for(j=0;j<c;j++) | |
{ | |
b[i][j]=a[k]; | |
k++; | |
} | |
} | |
printf("\nData Before Smoothing: \n"); | |
for(i=0;i<r;i++) | |
{ | |
for(j=0;j<c;j++) | |
{ | |
printf("%d\t",b[i][j]); | |
} | |
printf("\n"); | |
} | |
for(i=0;i<r;i++) | |
{ | |
sum=0; | |
for(j=0;j<c;j++) | |
{ | |
sum=sum+b[i][j]; | |
} | |
avg[i]=sum/c; | |
} | |
printf("\nBinning By Means: \n"); | |
for(i=0;i<r;i++) | |
{ | |
for(j=0;j<c;j++) | |
{ | |
printf("%d\t",avg[i]); | |
} | |
printf("\n"); | |
} | |
for(i=0;i<r;i++) | |
{ | |
l=b[i][0]; | |
h=b[i][c-1]; | |
for(j=0;j<c;j++) | |
{ | |
if((b[i][j]-l) < (h-b[i][j])) | |
{ | |
b[i][j]=l; | |
} | |
else | |
{ | |
b[i][j]=h; | |
} | |
} | |
} | |
printf("\nBinning by Boundries: \n"); | |
for(i=0;i<r;i++) | |
{ | |
for(j=0;j<c;j++) | |
{ | |
printf("%d\t",b[i][j]); | |
} | |
printf("\n"); | |
} | |
getch(); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment