//Programme to add to arrays

#include<stdio.h>
#include<conio.h>
void main()
{
int a[3][3],b[3][3],c[3][3],i,j;
clrscr();
for( i=0;i<3;i++)
{

for( j=0;j<3;j++)
scanf("%d",&a[i][j]);
printf("\n");}

printf(Enter Array 1:);

for(i=0;i<3;i++)
{

for( j=0;j<3;j++)
scanf("%d",&b[i][j]);
printf("\n");}

printf(Enter Array 2:);

for( i=0;i<3;i++)
for( j=0;j<3;j++)
c[i][j]=a[i][j]+b[i][j];
for( i=0;i<3;i++)
{

for( j=0;j<3;j++)
printf("%d ",c[i][j]);
printf("\n");}
getch();

//Programme to print pattern

#include<stdio.h>
#include<conio.h>
void main()
{
int i,j;
clrscr();
for(i=1;i<=6;i++)
{for(j=1;j<=i;j++)
printf("%d",j);
printf("\n");}
getch();
}

//Programme to multiply two arrays

#include<stdio.h>
#include<conio.h>
void main()
{
int a[3][3],b[3][3],c[3][3],i,j,k;
clrscr();
for(i=0;i<3;i++)
for(j=0;j<3;j++)
c[i][j]=0;
printf(Enter Array 1:);

for(i=0;i<3;i++)
{

for(j=0;j<3;j++)
scanf("%d",&a[i][j]);
printf("\n");}
printf(Enter Array 2:);
for(i=0;i<3;i++)
{

for(j=0;j<3;j++)
scanf("%d",&b[i][j]);
printf("\n");}
for(i=0;i<3;i++)
for(j=0;j<3;j++)
for(k=0;k<3;k++)
c[i][j]=c[i][j]+a[i][k]+b[k][i];
for(i=0;i<3;i++)

for(j=0;j<3;j++)
{ printf("%d",c[i][j]);
printf(" "); }
printf("\n");}
getch();

//Programme to find min & max element in an array

#include "stdafx.h"
#include<stdio.h>
int main ()

{
int i,j,a[10];
printf("Enter array elements:");
for( j=0;j<10;j++)
scanf_s("%d",&a[j]);
int max = a[0];
int min = a[0];
for (i = 0; i < 10; i++)
{
if (a[i] > max)
{
max = a[i];
}
else if (a[i] < min)
{
min = a[i];
}
}
printf ("Maximum element in an array : %d\n", max);
printf ("Minimum element in an array : %d\n", min);
return 0;
}

//Programme to sort a list using buuble sort

#include "stdafx.h"
#include <stdio.h>
int main()
{
int array[100], n, c, d, swap;
printf("Enter number of elements\n");
scanf_s("%d", &n);
printf("Enter %d integers\n", n);
for (c = 0; c < n; c++)
scanf_s("%d", &array[c]);
for (c = 0 ; c < ( n - 1 ); c++)
{
for (d = 0 ; d < n - c - 1; d++)
{
if (array[d] > array[d+1]) /* For decreasing order use < */
{
swap
= array[d];
array[d] = array[d+1];

array[d+1] = swap;
}
}
}
printf("Sorted list in ascending order:\n");
for ( c = 0 ; c < n ; c++ )
printf("%d\n", array[c]);
return 0;
}

//Programme to sort a list using selection sort

#include "stdafx.h"
#include <stdio.h>
int main()
{
int array[100], n, c, d, position, swap;
printf("Enter number of elements\n");
scanf_s("%d", &n);
printf("Enter %d integers\n", n);
for ( c = 0 ; c < n ; c++ )
scanf_s("%d", &array[c]);
for ( c = 0 ; c < ( n - 1 ) ; c++ )
{
position = c;
for ( d = c + 1 ; d < n ; d++ )
{
if ( array[position] > array[d] )
position = d;
}
if ( position != c )
{
swap = array[c];
array[c] = array[position];
array[position] = swap;
}
}
printf("Sorted list in ascending order:\n");
for ( c = 0 ; c < n ; c++ )
printf("%d\n", array[c]);
return 0;
}

//Programme for linear search

#include "stdafx.h"
#include <stdio.h>
int main()
{
int array[100], search, c, n;

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

scanf_s("%d",&n);
printf("Enter %d integer(s)\n", n);
for (c = 0; c < n; c++)
scanf_s("%d", &array[c]);
printf("Enter the number to search\n");
scanf_s("%d", &search);
for (c = 0; c < n; c++)
{
if (array[c] == search)
/* if required element found */
{
printf("%d is present at location %d.\n", search, c+1);
break;
}
}
if (c == n)
printf("%d is not present in array.\n", search);
return 0;
}

// Pogramme to find length of a string using pointers

#include "stdafx.h"
#include <stdio.h>
int main()
{
char array[100], *pointer;
int length = 0;
printf("Enter a string\n");
gets_s(array);
pointer = array;
while(*(pointer+length))
length++;
printf("Length of entered string = %d\n",length);
return 0;
}

//Programme to reverse a string using pointers

#include "stdafx.h"
#include<stdio.h>
int string_length(char*);
void reverse(char*);
void main()
{
char string[100];
printf("Enter a string\n");
gets_s(string);
reverse(string);
printf("Reverse of entered string is \"%s\".\n", string);
}
void reverse(char *string)
{
int length, c;
char *begin, *end, temp;
length = string_length(string);
begin = string;
end = string;
for ( c = 0 ; c < ( length - 1 ) ; c++ )
end++;
for ( c = 0 ; c < length/2 ; c++ )
{
temp = *end;
*end = *begin;
*begin = temp;
begin++;
end--;
}
}
int string_length(char *pointer)
{
int c = 0;
while( *(pointer+c) != '\0' )
c++;
return c;
}