Scribd
Upload
9 views7 pages

Lab 6

Uploaded by

Anongnart Boonkleang
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views7 pages

Lab 6

Uploaded by

Anongnart Boonkleang
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Lab6: Array Grader

// ID: 66070503459 Anognart Boonkleang


/* 1) Write a program in C to find the maximum and its index element in an array. */
#include<stdio.h>

int main() {
int i,n,j=0,arr[100];
scanf("%d",&n);

for(i=0;i<n;i++){
scanf("%d",&arr[i]);
}
for(i=1;i<n;i++){
if(arr[j]<arr[i]){
j = i;
}
}
printf("%d\n",arr[j]);
printf("%d\n",j);
return 0;
}
//Get 100 score : Finish
// ID: 66070503459 Anognart Boonkleang
/* 2) Write a program in C to find the second smallest element in an array and its
index. */
#include<stdio.h>

int main() {
int i,n,arr[100];
scanf("%d", &n);

for(i=0; i<n ; ++i){


scanf("%d", &arr[i]);
}
int value = 1001;
int second_value = 1001;
int value_index = -1;
int second_value_index = -1;

for(i=0 ; i<n ; ++i){


if(arr[i]<value){
second_value = value;
second_value_index = value_index;
value = arr[i];
value_index = i;
}else if(arr[i] < second_value && arr[i] != value){
second_value = arr[i];
second_value_index = i;
}
}
printf("%d\n", second_value);
printf("%d\n", second_value_index);
return 0;
}
//Get 100 score : Finish
// ID: 66070503459 Anognart Boonkleang
/* 3) Write a program in C to find the index of the first peak element in a given
array. */
#include<stdio.h>

int main() {
int i,n,j=0,arr[100];
scanf("%d",&n);

for(i=0;i<n;i++){
scanf("%d",&arr[i]);
}
for(i=1;i<n;i++){
if(arr[j]<arr[i]){
j = i;
}
}
printf("%d\n",j);
return 0;
}
//Get 100 score : Finish
// ID: 66070503459 Anognart Boonkleang
/* 4) WWrite a program in C to print all unique elements in an array. */
#include<stdio.h>

int main() {
int i,j,n,count,arr[100],freq[100];
scanf("%d", &n);

for(i=0 ; i<n; i++){


scanf("%d", &arr[i]);
freq[i] = -1;
}
for(i=0 ; i<n ; i++){
count =1;
for(j=i+1; j<n ; j++){
if(arr[i] == arr[j]){
count++;
freq[j] = 0;
}
}
if(freq[i] != 0){
freq[i] = count;
}
}
for(i=0 ; i<n ; i++){
if(freq[i] == 1){
printf("%d\n", arr[i]);
}
}
return 0;
}
//Get 100 score : Finish
// ID: 66070503459 Anognart Boonkleang
/* 5) Write a program in C to read n number of values in an array and display it in
reverse order. */
#include<stdio.h>

int main() {
int i,n,arr[100];
scanf("%d", &n);

for(i=0 ; i<n ; i++){


scanf("%d", &arr[i]);
}
for(i=n-1; i>=0; i--){
printf("%d\n", arr[i]);
}
}
//Get 100 score : Finish
// ID: 66070503459 Anognart Boonkleang
/* 6) Write a program in C to find the student grade from students' scores (A, B, C,
D, F) in a given array. */
#include<stdio.h>

int main() {
int i,n,Xi,Yi,Zi,sum[100],A,B,C,D;
scanf("%d", &n);

for(i=0 ; i<n ; i++){


scanf("%d %d %d", &Xi,&Yi,&Zi);
sum[i] = Xi + Yi + Zi;
}
scanf("%d", &A);
scanf("%d", &B);
scanf("%d", &C);
scanf("%d", &D);

for(i=0 ; i <n ;i++){


if(sum[i] >= A){
printf("A");
printf("\n");
}else if(sum[i] >= B && sum[i] < A){
printf("B");
printf("\n");
}else if(sum[i] >= C && sum[i] < B){
printf("C");
printf("\n");
}else if(sum[i] >= D && sum[i] < C){
printf("D");
printf("\n");
}else{
printf("F");
printf("\n");
}
}
}
//Get 100 score : Finish
// ID: 66070503459 Anognart Boonkleang
/* 7) Write a program in C to find two elements whose sum is closest to zero. */
#include<stdio.h>
#include<stdlib.h>
#include<math.h>

int main() {
int arr[100],count=0,i,j=0,msum=0,sum=0,value1=0,value2=0,n;
scanf("%d",&n); //Enter the number of the elements

for(i=0 ; i<n ; i++){


scanf("%d", &arr[i]);
}

value1 = 0;
value2 = 1;
msum = arr[0]+arr[1];

for(i=0; i<n ; i++){


for(j=i+1; j<n ; j++){
sum = arr[i] + arr[j];
if(abs(msum) > abs(sum)){
msum = sum;
value1 =i;
value2 =j;
}
}
}
printf("%d\n", arr[value1]);
printf("%d", arr[value2]);
return 0;
}
//Get 100 score : Finish

You might also like