Data Structures
Data Structures
Data Structures
RAGHUL SUBRAMANI
REG NO:19MIS1130
FACULTY NAME:KANCHANA
DEVI
INPUT:
#include<stdio.h>
#include<conio.h>
int main()
{
int a[10], b[10], c[10], i,j,m,n,k=0,x,count;
printf("Enter the number of elements in
the arrayA:");
scanf("%d",&m);
printf("Enter the elements for array A: ");
for(i=0; i<m; i++)
{
scanf("%d",&a[i]);
}
printf("Enter the number of elements in
the array B:");
scanf("%d",&n);
printf("Enter the elements for array B: ");
for(i=0;i<n;i++)
{
scanf("%d", &b[i]);
}
for(i=0; i<m; i++)
{
for(j=0; j<n; j++)
{
if(a[i]==b[j])
{
count = 0;
for(x=0; x<k; x++)
{
if(a[i]==c[x])
count++;
}
if(count==0)
{
c[k]=a[i];
k++;
}
}
}
}
printf("\nThe elements common in both
arrays are :\n");
for(i=0; i<k; i++)
{
printf("%d ",c[i]);
}
gets()
return 0;
INPUT:
int main()
{
int n,i,a[100];
int Even_Count=0,Odd_Count=0;
Even_Count = CountEvenNumbers(a,n);
Odd_Count = CountOddNumbers(a,n);
}
int CountEvenNumbers(int a[], int Size)
{
int i, Even_Count = 0;
printf("\nEven Numbers in this Array are: ");
for(i = 0; i < Size; i ++)
{
if(a[i] % 2 == 0)
{
printf("%d ", a[i]);
Even_Count++;
}
}
return Even_Count;
}
int CountOddNumbers(int a[], int Size)
{
int i, Odd_Count = 0;
printf("\nOdd Numbers in this Array are: ");
INPUT:
#include<stdio.h>
struct student
{
int rollno;
char name[100];
int score;
};
int main()
{
struct student s[20],temp;
int i,j,n;
printf("\nEnter no. of Students : ");
scanf("%d",&n);
printf("\nEnter the rollno,name,score
");
for(i=0;i<n;i++)
scanf("%d%s
%d",&s[i].rollno,s[i].name,&s[i].score);
for(i=0;i<=n-1;i++)
{
for(j=0;j<=n-1;j++)
{
if(s[j].score<s[j+1].score)
{
temp=s[j];
s[j]=s[j+1];
s[j+1]=temp;
}
}
}
#include <stdio.h>
int main()
{
int array[100], search, c, n;
INPUT:
#include <stdio.h>
int main()
{
int c, first, last, middle, n, search, array[100];
first=0;
last=n-1;
middle=(first+last)/2;
while (first<=last) {
if (array[middle]<search)
first = middle + 1;
else if (array[middle]==search) {
middle = (first+last)/2;
}
if (first>last)
printf("Not found! %d isn't present in the
list.\n", search);
return 0;
}