Scribd
Upload
22 views26 pages

Programming Assignment 5

The document contains source code for 7 C programming assignments: 1) Finding the sum of elements in an array 2) Finding the minimum and maximum elements in an array 3) Performing linear search on an array 4) Performing binary search on a sorted array 5) Implementing insertion sort on an array 6) Implementing bubble sort on an array using functions 7) Implementing merge sort on an array using functions

Uploaded by

12a03anishasabesan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views26 pages

Programming Assignment 5

The document contains source code for 7 C programming assignments: 1) Finding the sum of elements in an array 2) Finding the minimum and maximum elements in an array 3) Performing linear search on an array 4) Performing binary search on a sorted array 5) Implementing insertion sort on an array 6) Implementing bubble sort on an array using functions 7) Implementing merge sort on an array using functions

Uploaded by

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

Programming Assignment 5

NAME: KEERTHANA SENTHILNATHAN


ROLL NO.: 108120050
BRANCH : ECE DEPT 1ST YEAR
DATE:01.02.2021
SECTION: B
SOURCE CODE 1:To find the sum of elements in an array
#include <stdio.h>
int main()
{
int arr[10],i,max,min,n;
printf("Enter the no. of elements in the array\n");
scanf("%d",n);
printf("Enter %d elements of the array\n",n);
for(i=0;i<=n;i++)
{
scanf("%d",&arr[i]);
}
for(i=0;i<=n;i++)
{
sum=sum+arr[i];
}
printf("The sum of the elements of the array is %d ",sum);
return 0;
}
CODE 1:

OUTPUT 1:
SOURCE CODE 2:To find minimum and maximum of elements
in an array :
#include <stdio.h>
int main()
{
int arr[10],i,max,min,n;
printf("Enter the no. of elements in the array\n");
scanf("%d",n);
printf("Enter %d elements of the array\n",n);
for(i=0;i<=n;i++)
{
scanf("%d",&arr[i]);
}

min=arr[0];
max=arr[0];
for(i=1;i<=n;i++)
{
if(min>arr[i])
{
min=arr[i];
}
if(max<arr[i])
{
max=arr[i];
}

}
printf("Maximum and Minimum is %d and %d",max,min);
return 0;
}

CODE 2:
OUTPUT 2:
SOURCE CODE 3 :To Perform Linear Search:
#include <stdio.h>

int main()
{
int arr[10],i,n,value;
printf("Enter the no. of elements in the array\n");
scanf("%d",&n);
printf("Enter %d elements of the array\n",n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&arr[i]);
}
printf("Enter the value\n");
scanf("%d",&value);

for(i=0;i<=n-1;i++)
{
if(value == arr[i])
{
printf("%d is present at the index position %d \n",value,i);
break;
}
}
if(i==n)
{
printf("Element not found");
}

return 0;
}

CODE 3 :
OUTPUT 3:
SOURCE CODE 4 :To perform Binary Search:

#include <stdio.h>
int main()
{
int i, low, high, mid, n, value, array[100];

printf("Enter number of elements\n");


scanf("%d", &n);

printf("Enter %d integers\n", n);

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


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

printf("Enter value to find\n");


scanf("%d", &value);

low = 0;
high = n - 1;
mid = (low+high)/2;

while (low <= high)


{
if (array[mid] < value)
low = mid + 1;
else if (array[mid] == value) {
printf("%d found at location %d.\n", value, mid);
printf("low is %d and high is %d",low,high);
break;
}
else
high = mid - 1;

mid = (high + low)/2;


}
if (low > high)
printf("Not found! %d isn't present in the list.\n", value);

return 0;
}
CODE 4:
OUTPUT 4:
SOURCE CODE 5 :To perform Insertion Sort:

#include <stdio.h>
int main()
{
int n, i, j, temp;
int arr[100];

printf("Enter number of elements\n");


scanf("%d", &n);

printf("Enter %d integers\n", n);


for (i = 0; i < n; i++)
{
scanf("%d", &arr[i]);
}
for (i = 1 ; i <= n - 1; i++)
{
j = i;
while ( j > 0 && arr[j-1] > arr[j])
{
temp = arr[j];
arr[j] = arr[j-1];
arr[j-1] = temp;
j--;
}
}
printf("Sorted list in ascending order:\n");
for (i = 0; i <= n - 1; i++)
{
printf("%d\n", arr[i]);
}
return 0;
}

CODE 5:
OUTPUT 5:
SOURCE CODE 6 :To perform Bubble Sort using functions and
arrays:

#include <stdio.h>

void bubblesort(int arr[],int n);

int main()
{
int arr[10],i,n,value;
printf("Enter the no. of elements in the array\n");
scanf("%d",&n);
printf("Enter %d elements of the array\n",n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&arr[i]);
}

bubblesort(arr,n);

printf("\nElements after bubble sort : ");

for(i=0;i<n;i++)
{
printf("%d ",arr[i]);
}

return 0;
}

void bubblesort(int arr[],int n)


{
int i,j,temp;

for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(arr[j+1]<arr[j])
{
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
}

CODE 6:
OUTPUT 6:
SOURCE CODE 7 :To perform Merge Sort using functions:
#include <stdio.h>

void mergesort(int arr[],int i, int j);


void merge(int a[], int i1, int j1, int i2, int j2);

int main()
{
int arr[10],i,n;

printf("Enter the no. of elements in the array\n");


scanf("%d",&n);

printf("Enter %d elements of the array\n",n);


for(i=0;i<=n-1;i++)
{
scanf("%d",&arr[i]);
}

mergesort(arr,0,n-1);

printf("\n Sorted array is:");


for(i=0;i<n;i++)
printf("%d",arr[i]);
return 0;
}

void mergesort(int arr[],int i, int j)


{
int mid;

{
mid=(i+j)/2;
mergesort(arr,i,mid);
mergesort(arr,mid+1,j);
merge(arr,i,mid,mid+1,j);
}
}

void merge(int arr[],int i1, int j1, int i2, int j2)
{
int temp[50];
int i,j,k;
i=i1;
j=i2;
k=0;

while(i<=j1 && j<=j2)


{
if(arr[i]<arr[j])
{
temp[k++]=arr[i++];
}
else
{
temp[k++]=arr[j++];
}
}
while(i<=j1)
{
temp[k++]=arr[j++];
}
while(j<=j2)
{
temp[k++]=arr[j++];
}

for(i=i1;j=0;i<j2;i++;j++)
{
arr[i]=temp[j];
}
}
CODE 7:
OUTPUT 7:

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy