Scribd
Upload
7 views3 pages

2D Array Operations and Sorting Techniques

The document contains multiple C programs that demonstrate various array operations. These include displaying a 2D array with its diagonal and boundary elements, bubble sorting a single-dimensional array, performing a binary search on a descending ordered array, and separating even and odd values from an array. Each program prompts the user for input and displays the results accordingly.

Uploaded by

huhulululuofficial
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
7 views3 pages

2D Array Operations and Sorting Techniques

The document contains multiple C programs that demonstrate various array operations. These include displaying a 2D array with its diagonal and boundary elements, bubble sorting a single-dimensional array, performing a binary search on a descending ordered array, and separating even and odd values from an array. Each program prompts the user for input and displays the results accordingly.

Uploaded by

huhulululuofficial
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

//2D array display, diagonal, boundary elements

#include<stdio.h>
int main()
{
int arr[100][100],n,i,j,max,min;
printf("\n Enter the size of the matrix :");
scanf("%d",&n);
printf("\n Enter %d numbers to fill the array :",n*n);
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf("\n Enter element %d,%d :",i,j);
scanf("%d",&arr[i][j]);
}
}
printf("\n The array is :\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf("%d ",arr[i][j]);
}
printf("\n");
}
printf("\n The diagonals of the array is :\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(i==j || i+j==n-1)
printf("%d ",arr[i][j]);
else
printf(" ");
}
printf("\n");
}
printf("\n The boundary elements of the array is :\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(i==0 || j==0|| i==n-1|| j==n-1)
printf("%d ",arr[i][j]);
else
printf(" ");
}
printf("\n");
}
return 0;
}
//Bubble sorting Single Dimensional Array of size 10

#include<stdio.h>
int main()
{
int arr[10],i,j,temp;
printf("\nEnter 10 values to fill the array :");
for(i=0;i<10;i++)
{
printf("\nEnter value %d :",i+1);
scanf("%d",&arr[i]);
}
for(i=0;i<9;i++)
{
for(j=i+1;j<10;j++)
{
if(arr[j]> arr[i])
{
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
}
printf("\n The sorted array is :\n");
for(i=0;i<10;i++)
printf("%d ",arr[i]);

return 0;
}

//binary search in an array of size 10

#include<stdio.h>
int main()
{
int arr[10],i,first=0,last=9,mid,pos=0,x=0,srch;
printf("\nEnter 10 values in descending order to fill the array :");
for(i=0;i<10;i++)
{
printf("\nEnter value %d :",i+1);
scanf("%d",&arr[i]);
}
printf("\n Enter the value to search :");
scanf("%d",&srch);

while(first<=last)
{
mid=(first+last)/2;
if(srch>arr[mid])
last=mid-1;
if(srch<arr[mid])
first=mid+1;
if(srch==arr[mid])
{
pos=mid+1;
x=1;
break;
}
}
if(x==1)
printf("\n%d was found at position %d",srch,pos);
else
printf("\n%d was not found",srch);
return 0;
}

//Displaying the even and odd values separately

#include<stdio.h>
int main()
{
int arr[10],i,even[10],odd[10],x=0,y=0;
printf("\nEnter 10 values to fill the array :");
for(i=0;i<10;i++)
{
printf("\nEnter value %d :",i+1);
scanf("%d",&arr[i]);
}
for(i=0;i<10;i++)
{
if(arr[i]%2==0)
even[x++]=arr[i];
else
odd[y++]=arr[i];
}
printf("\n The even values are :\n");
for(i=0;i<x;i++)
printf("%d ",even[i]);

printf("\n The odd values are :\n");


for(i=0;i<y;i++)
printf("%d ",odd[i]);

return 0;
}

You might also like