void inputs(int c[],int so[],int ss[],int sss[],int k)
{
int i;
printf("Enter Roll No.=");
scanf("%d",&c[k]);
for(i=0;i<k;i++)
if(c[k]==c[i])
{
printf("Roll No. of Two Students cannot be Same.\n");
printf("Enter Roll No. Again=");
scanf("%d",&c[k]);
}
printf("Enter MARKS of SUBJECT 1=");
scanf("%d",&so[k]);
printf("Enter MARKS of SUBJECT 2=");
scanf("%d",&ss[k]);
printf("Enter MARKS of SUBJECT 3=");
scanf("%d",&sss[k]);
}
void mao(int m[],int so[],int ss[],int sss[],int k)
{
m[k]=so[k]+ss[k]+sss[k];
}
void age(float p[],int m[],int k)
{
p[k]=m[k]/3.0;
}
void gra(int gd[],float p[],int k)
{
if(p[k]>=80)
gd[k]=1;
else if(p[k]>=70 && p[k]<80)
gd[k]=2;
else if(p[k]>=60 && p[k]<70)
gd[k]=3;
else if(p[k]>=50 && p[k]<60)
gd[k]=4;
else
gd[k]=5;
}
double cavg(int m[],int l)
{
int i,sum=0;
double ca;
for(i=0;i<l;i++)
sum=sum+m[i];
ca=sum/l;
return ca;
}
void first_last(int m[],int c[],int l)
{
int i,max=m[0],max_index=0,min=m[0],min_index=0;
clrscr();
for(i=1;i<l;i++)
{
if(max<m[i])
{
max=m[i];
max_index=i;
}
else if(min>m[i])
{
min=m[i];
min_index=i;
}
}
printf("Roll Number of TOPPER Student is %d",c[max_index]);
printf("\nRoll Number of NULL Student is %d",c[min_index]);
}
void sortA_mao(int c[],int so[],int ss[],int sss[],int m[],float p[],int gd[],int e[],int l)
{
int i,j,large,l_index;
for(i=0;i<l-1;i++)
{
large=m[i];
l_index=i;
for(j=i+1;j<l;j++)
{
if(large<m[j])
{
large=m[j];
l_index=j;
}
}
m[l_index]=m[i];
m[i]=large;
e[i]=c[i];
c[i]=c[l_index];
c[l_index]=e[i];
e[i]=so[i];
so[i]=so[l_index];
so[l_index]=e[i];
e[i]=ss[i];
ss[i]=ss[l_index];
ss[l_index]=e[i];
e[i]=sss[i];
sss[i]=sss[l_index];
sss[l_index]=e[i];
e[i]=p[i];
p[i]=p[l_index];
p[l_index]=e[i];
e[i]=gd[i];
gd[i]=gd[l_index];
gd[l_index]=e[i];
}
}
void sortD_mao(int c[],int so[],int ss[],int sss[],int m[],float p[],int gd[],int e[],int l)
{
int i,j,small,s_index;
for(i=0;i<l-1;i++)
{
small=m[i];
s_index=i;
for(j=i+1;j<l;j++)
{
if(small>m[j])
{
small=m[j];
s_index=j;
}
}
m[s_index]=m[i];
m[i]=small;
e[i]=c[i];
c[i]=c[s_index];
c[s_index]=e[i];
e[i]=so[i];
so[i]=so[s_index];
so[s_index]=e[i];
e[i]=ss[i];
ss[i]=ss[s_index];
ss[s_index]=e[i];
e[i]=sss[i];
sss[i]=sss[s_index];
sss[s_index]=e[i];
e[i]=p[i];
p[i]=p[s_index];
p[s_index]=e[i];
e[i]=gd[i];
gd[i]=gd[s_index];
gd[s_index]=e[i];
}
}
void fetch(int c[],int so[],int ss[],int sss[],int m[],float p[],int gd[],int el,int l)
{
int i,a,loc=-1;
char g;
clrscr();
printf("R.No.\tSUB 1\tSUB 2\tSUB 3\tT.MARKS\t%AGE\tGRADE");
for(i=0;i<l;i++)
{
switch(gd[i])
{
case 1:
g='A';
break;
case 2:
g='B';
break;
case 3:
g='C';
break;
case 4:
g='D';
break;
case 5:
g='F';
break;
}
if(el==c[i])
{
loc=i;
break;
}
}
if(loc==-1)
printf("\nSORRY! \x1 RECORD OF \"%d\" DOES NOT EXIST.",el);
else
{
printf("\n%d\t%d\t%d\t%d\t%d\t%0.2f\t%c",c[loc],so[loc],ss[loc],sss[loc],m[loc],p[loc],g);
}
}
void display(int s[],int c[],int so[],int ss[],int sss[],int m[],float p[],int gd[],int l,double ca)
{
int i;
char g;
clrscr();
printf("S.No.\tR.No.\tSUB 1\tSUB 2\tSUB 3\tT.MARKS\t%AGE\tGRADE\n");
for(i=0;i<l;i++)
{
s[i]=i+1;
switch(gd[i])
{
case 1:
g='A';
break;
case 2:
g='B';
break;
case 3:
g='C';
break;
case 4:
g='D';
break;
case 5:
g='F';
break;
}
printf("%d\t%d\t%d\t%d\t%d\t%d\t%0.2f\t%c\n",s[i],c[i],so[i],ss[i],sss[i],m[i],p[i],g);
}
printf("\nCLASS AVERAGE is=%0.2f",ca);
}
void S_display(int c[],int so[],int ss[],int sss[],int m[],float p[],int gd[],int l,double ca)
{
int i;
char g;
clrscr();
printf("R.No.\tSUB 1\tSUB 2\tSUB 3\tT.MARKS\t%AGE\tGRADE\n");
for(i=0;i<l;i++)
{
switch(gd[i])
{
case 1:
g='A';
break;
case 2:
g='B';
break;
case 3:
g='C';
break;
case 4:
g='D';
break;
case 5:
g='F';
break;
}
printf("%d\t%d\t%d\t%d\t%d\t%0.2f\t%c\n",c[i],so[i],ss[i],sss[i],m[i],p[i],g);
}
printf("\nCLASS AVERAGE is=%0.2f",ca);
}
Maybe Github would be the place to post your source code.
ReplyDeleteIf it was a decent post about linked lists that actually had plain text explaining what it's doing and why it would be of use.
Currently it just looks like a bit of meaningless copy and paste from some homework sheet.
There are not even comments in the code. Very unprofessional, very amature.