C program to add two matrix.

Program to add two matrix

#include <stdio.h>

int main()
{
   int m, n, c, d, first[10][10], second[10][10], sum[10][10];

   printf("Enter the number of rows and columns of matrix\n");
   scanf("%d%d", &m, &n);
   printf("Enter the elements of first matrix\n");

   for (c = 0; c < m; c++)
      for (d = 0; d < n; d++)
         scanf("%d", &first[c][d]);

   printf("Enter the elements of second matrix\n");

   for (c = 0; c < m; c++)
      for (d = 0 ; d < n; d++)
            scanf("%d", &second[c][d]);

   printf("Sum of entered matrices:-\n");

   for (c = 0; c < m; c++) {
      for (d = 0 ; d < n; d++) {
         sum[c][d] = first[c][d] + second[c][d];
         printf("%d\t", sum[c][d]);
      }
      printf("\n");
   }

   return 0;
}

Output:-

Insertion sort in C.

Insertion sort algorithm implementation in c

#include <stdio.h>

int main()

{

  int n, array[1000], c, d, t;

 

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

  scanf("%d", &n);

 

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

 

  for (c = 0; c < n; c++) {

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

  }

 

  for (c = 1 ; c <= n - 1; c++) {

    d = c;

 

    while ( d > 0 && array[d] < array[d-1]) {

      t          = array[d];

      array[d]   = array[d-1];

      array[d-1] = t;

 

      d--;

    }

  }

 

  printf("Sorted list in ascending order:\n");

 

  for (c = 0; c <= n - 1; c++) 

{

    printf("%d\n", array[c]);

  }

 

  return 0;

}

Output:-

Program to implement Selection sort in C.

Selection sort algorithm implementation in c

#include <stdio.h>

int main()

{

   int array[100], n, c, d, position, swap;

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

   scanf("%d", &n);

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

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

      scanf("%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;

}

Output:-

Bubble Sort Program in C.

Bubble Sort Program in C

#include <stdio.h>

int main()
{
  int array[100], n, c, d, swap;

  printf("Enter number of elements\n");
  scanf("%d", &n);

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

  for (c = 0; c < n; c++)
    scanf("%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;
}

Output:-