Operation On Single Dimensional Array
Bubble Sorting
#include<stdio.h>
#define n 10
int main()
{
int arr[n],temp;
printf("Enter %d Number ",n);
for(int i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
for(int i=0;i<n-1;i++)
{
for(int j=0;j<n-1;j++)
{
if(arr[j]<arr[j+1]) // for descending
// for ascending arr[j]<arr[j+1]
{
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
printf("Sorted Elements are = \n ");
for(int i=0;i<n;i++)
{
printf(" %d ",arr[i]);
}
}
2) SELECTION SORT
#include<stdio.h>
#define n 5
int main()
{
int arr[n],temp;
printf("Enter %d Number ",n);
for(int i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(arr[i]<arr[j]) //descending
// arr[i]<arr[j] ascending
{
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
}
printf("Sorted Elements are = \n ");
for(int i=0;i<n;i++)
{
printf(" %d ",arr[i]);
}
}
OUTPUT:
Enter 5 Number 46
456
464
474
575
Sorted Elements are =
575 474 464 456 46
MERGE TWO ARRAY AND SORT THEM
#include <stdio.h>
int main()
{
int n1,n2,n3; //Array Size Declaration
printf("\nEnter the size of first array ");
scanf("%d",&n1);
printf("\nEnter the size of second array ");
scanf("%d",&n2);
n3=n1+n2;
printf("\nEnter the 1st array elements");
int a[n1],b[n2],c[n3]; //Array Declaration
for(int i=0;i<n1;i++) //Array Initialized
{
scanf("%d",&a[i]);
c[i]=a[i];
}
int k=n1;
printf("\nEnter the 2nd array elements");
for(int i=0;i<n2;i++) //Array Initialized
{
scanf("%d",&b[i]);
c[k]=b[i];
k++;
}
printf("\nThe merged array..\n");
for(int i=0;i<n3;i++)
printf("%d ",c[i]); //Print the merged array
printf("\nAfter sorting...\n");
for(int i=0;i<n3;i++) //Sorting Array
{
int temp;
for(int j=0; j<n3 ;j++)
{
if(c[j]<c[j+1])
{
temp=c[j];
c[j]=c[j+1];
c[j+1]=temp;
}
}
}
for(int i=0 ; i<n3 ; i++) //Print the sorted Array
{
printf(" %d ",c[i]);
}
return 0;
}
OUTPUT
Enter the size of first array 3
Enter the size of second array 4
Enter the 1st array elements24
32
4
Enter the 2nd array elements324324
432
432
234
The merged array..
24 32 4 324324 432 432 234
After sorting...
324324 432 432 234 32 24 4
Comments
Post a Comment