DSC314 Data Structure Lab1
DSC314 Data Structure Lab1
DSC314 Data Structure Lab1
#include <stdio.h>
int main()
{
int arr[10];
int i;
}
void addition(int r,int c,int a[10][10],int b[10][10])
{
int add[10][10],i,j;
for (i = 0; i < r; i++)
{
for (j = 0; j < c; j++)
add[i][j] = a[i][j] + b[i][j];
}
printf("Addition of two matrices: \n");
for (i = 0; i < r; i++){
for (j = 0; j < c; j++)
printf("%d\t", add[i][j]);
printf("\n");
}
}
void main()
{
int mat1[12][12],mat2[12][12];
int i,j,k,m,n,p;
printf("Enter the number of rows and columns for 1st matrix\
n");
scanf("%d%d",&m,&n);
printf("Enter the elements of the 1st matrix\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&mat1[i][j]);
}
}
multiply(mat1,mat2,m,n,p);
}
#include <stdio.h>
int main()
{
int arr[] = {15, 8, 10, 6, 13,17};
int n = sizeof(arr)/sizeof(arr[0]);
selectionSort(arr, n);
printf("Sorted array: \n");
printArray(arr, n);
return 0;
}
6.Insertion Sort
#include <stdio.h>
int main()
{
int arr[] = { 15, 8, 10, 6, 13,17 };
int n = sizeof(arr) / sizeof(arr[0]);
insertionSort(arr, n);
printArray(arr, n);
return 0;
}
7.Bubble sort
#include <stdbool.h>
#include <stdio.h>
exchange = false;
}
}
int main()
{
int arr[] = { 15, 8, 10, 6, 17, 13 };
int n = sizeof(arr) / sizeof(arr[0]);
bubbleSort(arr, n);
printf("Sorted array: \n");
printArray(arr, n);
return 0;
}