C PROGRAM TO PRINT NAME INSIDE A BEATING HEART


#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#include <time.h>

 char name[15];

 void main()
{
   int i;
   clrscr();
   textcolor(RED);
   printf("Enter his/her name: ");
   scanf("%s",&name);
   heart();
   for(i=0; i<10; i++)
   {
      clrscr();
      delay(300);
      beat();
      delay(300);
   }
   getch();
}
r()
{
   char randomletter;
   randomize();
   randomletter = 65+random(27);
   return randomletter;
}
l(int start, int stop, int y)
{
   int x;
   for(x=start;x<=stop;x++)
   {
   gotoxy(x,y);
   cprintf("%c",r());
   }
   delay(100);
}
heart()
{
   int x;
   l(40,40,24);
   l(39,41,23);
   l(38,42,22);
   l(36,44,21);
   l(34,46,20);
   l(31,49,19);
   l(29,51,18);
   l(28,52,17);
   l(28,52,16);
   l(29,51,15);
   l(29,51,14);
   l(31,39,13);   l(41,49,13);
   l(33,37,12);   l(43,47,12);
}
l2(int start, int stop, int y)
{
   int x;
   for(x=start;x<=stop;x++)
   {
   gotoxy(x,y);
   cprintf("%c",r());
   }
}

 beat()
{
   int x;
   textcolor(RED);
   l2(40,40,24);
   l2(39,41,23);
   l2(38,42,22);
   l2(36,44,21);
   l2(34,46,20);
   l2(31,49,19);
   l2(29,51,18);
   l2(28,52,17);
   l2(28,52,16);
   l2(29,51,15);
   l2(29,51,14);
   l2(31,39,13);   l2(41,49,13);
   l2(33,37,12);   l2(43,47,12);
   gotoxy(37,18);
   textcolor(GREEN);
   cprintf("%s",name);
}

 Output:

C PROGRAM TO PRINT NAME CREATIVELY FLASHING WITH RANDOM CHARACTERS


#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <dos.h>
#include <conio.h>

int even_or_odd=1;
void main()
{
  int x=1,y=4;
  char c, name[20];
  clrscr();
  printf("Enter your name: ");
  scanf("%s",&name);
  changecolor();
  while(!kbhit())
  {
    srand(time(NULL));
    c = rand();
    gotoxy(x,y);
    cprintf("%c",c);
    y++;
    if(y==21)
    {
      x++;
      y=4;
    }
    if(x==80)
    {
      x=1;
      even_or_odd++;
      changecolor();
    }
  gotoxy(35,12);
  cprintf(" %s ",name);
  }
}

changecolor()
{
  if(even_or_odd%2==0)
  {
    textcolor(BLUE);
  }
  else textcolor(GREEN);
}

Output:

C PROGRAM TO CHECK WHETHER A MATRIX IS SPARCE MATRIX OR NOT


#include <stdio.h>

void main ()
{
    static int array[10][10];
    int i, j, m, n;
    int counter = 0;
    clrscr();

    printf("Enter the order of the matix \n");
    scanf("%d %d", &m, &n);
    printf("Enter the co-efficients of the matix \n");
    for (i = 0; i < m; ++i)
    {
        for (j = 0; j < n; ++j)
        {
            scanf("%d", &array[i][j]);
            if (array[i][j] == 0)
            {
                ++counter;
            }
        }
    }
    if (counter > ((m * n) / 2))
    {
        printf("The given matrix is sparse matrix \n");
    }
    else
        printf("The given matrix is not a sparse matrix \n");
    printf("There are %d number of zeros", counter);
    getch();

}

Output:
                                                                               OR


C PROGRAM TO FIND SUM AND PRODUCT OF TWO MATRICES


#include <stdio.h>
void main()
{
    int a[2][2], b[2][2], c[2][2], d[2][2], i,j,k, sum;
    clrscr();

    printf("Enter elements of first matrix as a11 a12 a21 a22:\n");
    for(i=0; i<2; ++i)
        for(j=0; j<2; ++j)
            scanf("%d",&a[i][j]);

    printf("First matrix:\n");
    for(i=0; i<2; ++i)
        {
            for(j=0; j<2; ++j)
                printf("%d\t",a[i][j]);
            printf("\n");
        }

    printf("Enter elements of second matrix as a11 a12 a21 a22:\n");
    for(i=0; i<2; ++i)
        for(j=0; j<2; ++j)
            scanf("%d",&b[i][j]);

    printf("Second Matrix:\n");
    for(i=0; i<2; ++i)
        {
            for(j=0; j<2; ++j)
                printf("%d\t",b[i][j]);
            printf("\n");
        }

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

    for(i=0;i<2;i++)
        {
            for(j=0;j<2;j++)
            {
                for(k=0;k<2;k++)
                    {
                        sum=sum+a[i][k]*b[k][j];
                    }
                d[i][j]=sum;
                sum = 0;
            }
        }

   
    printf("Sum of matrices:\n");
    for(i=0; i<2; ++i)
        {
            for(j=0; j<2; ++j)
                printf("%d\t",c[i][j]);
            printf("\n");
        }

    printf("Product of matrices:\n");
    for(i=0; i<2; ++i)
        {
            for(j=0; j<2; ++j)
                printf("%d\t",d[i][j]);
            printf("\n");
        }

    getch();

}

Output:

C PROGRAM TO TRANSPOSE THE ELEMENTS OF A MATRIX


#include <stdio.h>
void main()
{
    int a[2][2], trans[2][2],i,j;
    clrscr();

    printf("Enter elements of matrix as a11 a12 a21 a22:\n");
    for(i=0; i<2; ++i)
        for(j=0; j<2; ++j)
            scanf("%d",&a[i][j]);

    printf("Matrix entered:\n");
    for(i=0; i<2; ++i)
    {
        for(j=0; j<2; ++j)
            printf("%d\t",a[i][j]);
        printf("\n");
    }

    for(i=0; i<2; ++i)
        for(j=0; j<2; ++j)
            trans[j][i]=a[i][j];

    printf("Transpose of Matrix:\n");
    for(i=0; i<2; ++i)
    {
        for(j=0; j<2; ++j)
            printf("%d\t",trans[i][j]);
        printf("\n");
    }
    getch();

}

Output:

C PROGRAM TO INSERT AND PRINT A MATRIX


#include <stdio.h>

void main()
{
   int a[2][2],i,j;
   clrscr();

   printf("Enter elements in matrix as a11 a12 a21 a22\n");
   for(i=0;i<2;i++)
      for(j=0;j<2;j++)
                 scanf("%d",&a[i][j]);

   printf("Matrix entered:\n");
   for(i=0;i<2;i++)
   {
      for(j=0;j<2;j++)
                 printf("%d\t",a[i][j]);
      printf("\n");
   }

   getch();

}

Output:

C PROGRAM TO PERFORM QUICK SORT IN AN ARRAY


#include<stdio.h>

void quicksort(int [10],int,int);

void main(){
  int x[20],size,i;
  clrscr();

  printf("Enter size of the array: ");
  scanf("%d",&size);

  printf("Enter %d elements:\n",size);
  for(i=0;i<size;i++)
    scanf("%d",&x[i]);

  quicksort(x,0,size-1);

  printf("Sorted elements:");
  for(i=0;i<size;i++)
    printf("\n%d",x[i]);

  getch();
}

void quicksort(int x[10],int first,int last){
    int pivot,j,temp,i;

     if(first<last){
         pivot=first;
         i=first;
         j=last;

         while(i<j){
             while(x[i]<=x[pivot]&&i<last)
                 i++;
             while(x[j]>x[pivot])
                 j--;
             if(i<j){
                 temp=x[i];
                  x[i]=x[j];
                  x[j]=temp;
             }
         }

         temp=x[pivot];
         x[pivot]=x[j];
         x[j]=temp;
         quicksort(x,first,j-1);
         quicksort(x,j+1,last);

    }

}

Output:

C PROGRAM TO PERFORM BINARY SEARCH IN AN ARRAY


#include <stdio.h>

void main()
{
   int c, first, last, middle, n, search, array[100];
   clrscr();

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

   printf("Enter %d integers in sorted form (Ascending)\n", n);

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

   printf("Enter value to find: ");
   scanf("%d", &search);

   first = 0;
   last = n - 1;
   middle = (first+last)/2;

   while (first <= last) {
      if (array[middle] < search)
         first = middle + 1;   
      else if (array[middle] == search) {
         printf("%d found at location %d.\n", search, middle+1);
         break;
      }
      else
         last = middle - 1;

      middle = (first + last)/2;
   }
   if (first > last)
      printf("Not found! %d is not present in the list.\n", search);

   getch();

}

Output:

C PROGRAM TO MERGE TWO ARRAYS

Download PDF of full program
Download .C file of program
(Right click and select 'Save link as' or 'Save Target as')

#include <stdio.h>

void merge(int [], int, int [], int, int []);

void main() {
  int a[100], b[100], m, n, c, sorted[200];
  clrscr();

  printf("Input number of elements in first array: ");
  scanf("%d", &m);

  printf("Input %d integers\n", m);
  for (c = 0; c < m; c++) {
    scanf("%d", &a[c]);
  }

  printf("Input number of elements in second array: ");
  scanf("%d", &n);

  printf("Input %d integers\n", n);
  for (c = 0; c < n; c++) {
    scanf("%d", &b[c]);
  }

  merge(a, m, b, n, sorted);

  printf("Sorted array:\n");

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

  getch();
}

void merge(int a[], int m, int b[], int n, int sorted[]) {
  int i, j, k;

  j = k = 0;

  for (i = 0; i < m + n;) {
    if (j < m && k < n) {
      if (a[j] < b[k]) {
        sorted[i] = a[j];
        j++;
      }
      else {
        sorted[i] = b[k];
        k++;
      }
      i++;
    }
    else if (j == m) {
      for (; i < m + n;) {
        sorted[i] = b[k];
        k++;
        i++;
      }
    }
    else {
      for (; i < m + n;) {
        sorted[i] = a[j];
        j++;
        i++;
      }
    }
  }

}

Output:

C PROGRAM TO PERFORM INSERTION SORT IN AN ARRAY


#include <stdio.h>
#include <conio.h>
void main()
{
  int n, array[10], i, j, temp;
  clrscr();

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

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

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

  for (i = 1 ; i <= n - 1; i++) {
    j = i;

    while ( j > 0 && array[j] < array[j-1]) {
      temp       = array[j];
      array[j]   = array[j-1];
      array[j-1] = temp;
      j--;
    }
  }

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

  for (i = 0; i <= n - 1; i++) {
    printf("%d\n", array[i]);
  }

  getch();

}

Output:

C PROGRAM TO PERFORM SELECTION SORT IN AN ARRAY


#include <stdio.h>
#include <conio.h>
void main()
{
   int array[10], n, i, j, position, swap;
   clrscr();

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

   printf("Enter %d integers\n", n);
   for ( i = 0 ; i < n ; i++ )
      scanf("%d", &array[i]);

   for ( i = 0 ; i < ( n - 1 ) ; i++ )
   {
      position = i;

      for ( j = i + 1 ; j < n ; j++ )
      {
         if ( array[position] > array[j] )
            position = j;
      }
      if ( position != i )
      {
         swap = array[i];
         array[i] = array[position];
         array[position] = swap;
      }
   }
   printf("Sorted list in ascending order:\n");

   for ( i = 0 ; i < n ; i++ )
      printf("%d\n", array[i]);

   getch();

}

Output:

C PROGRAM TO PERFORM BUBBLE SORT IN AN ARRAY


#include <stdio.h>
#include <conio.h>
void main()
{
  int array[10], n, i, j, swap;
  clrscr();

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

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

  for (i=0;i<n;i++)
    scanf("%d", &array[i]);

  for (i=0;i<n-1;i++)
  {
    for (j=0;j<n-i-1;j++)
    {
      if (array[j] > array[j+1])
      {
        swap       = array[j];
        array[j]   = array[j+1];
        array[j+1] = swap;
      }
    }
  }

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

  getch();

}

Output:

C PROGRAM TO PERFORM LINEAR SEARCH IN AN ARRAY


#include <stdio.h>
#include <conio.h>
void main()
{
   int array[10], search, i, n;
   clrscr();

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

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

   for (i = 0; i < n; i++)
      scanf("%d", &array[i]);

   printf("Enter the number to search\n");
   scanf("%d", &search);

   for (i = 0; i < n; i++)
   {
      if (array[i] == search)
      {
         printf("%d is present at location %d.\n", search, i+1);
         break;
      }
   }
   if (i == n)
      printf("%d is not present in array.\n", search);

   getch();

}

Output:

C PROGRAM TO INSERT AN ELEMENT IN SORTED ARRAY BY MEANS OF INFORMATION


#include<stdio.h>
#include<conio.h>
void main( )
{
     int a[10],n,item,i;
     clrscr();

     printf("Enter the size of the array: ");
     scanf("%d",&n);
    
     printf("Enter elements of the array in the sorted order\n");
     for(i=0; i<n; i++)
     {
            scanf("%d", &a[i]);
     }
    
     printf("Enter ITEM to be inserted : ");
     scanf("%d", &item);
    
     i = n-1;
     while(item<a[i] && i>=0)
     {
           a[i+1] = a[i];
           i--;
     }
     a[i+1] = item;
     n++;
    
     printf("After insertion array is :\n");
     for(i=0; i<n-1; i++)
     {
              printf("%d\n", a[i]);
     }
     getch();

}    

Output:

C PROGRAM TO INSERT AN ELEMENT IN ARRAY BY MEANS OF POSITION


#include <stdio.h>
#include <conio.h>
void main()
{
   int array[10], position, i, n, value;
   clrscr();

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

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

   for (i = 0; i < n; i++)
      scanf("%d", &array[i]);

   printf("Enter the location where you wish to insert an element\n");
   scanf("%d", &position);

   printf("Enter the value to insert\n");
   scanf("%d", &value);

   for (i = n - 1; i >= position - 1; i--)
      array[i+1] = array[i];

   array[position-1] = value;

   printf("Resultant array is\n");

   for (i = 0; i <= n-1; i++)
      printf("%d\n", array[i]);

   getch();

}

Output:

Subscribe to: Posts (Atom)