UNIT 5 notes updated in the below link

UNIT 5 notes click below link

https://sites.google.com/site/cs6202pds1/home





Save water:

Espure water solutions Pvt Ltd

http://enpure.in/sewage-treatment-plant/

Linear Search

                                  Linear Search

#include<stdio.h>
#include<conio.h>
void main()
{
 int a[20],i,ele,n;
 scanf("%d",&n);
 for(i=0;i<n;i++)
 {
  scanf("%d",&a[i]);
 }
 printf("enter search");
 scanf("%d",&ele);
 for(i=1;i<=n;i++)
 {
  if(ele==a[i])
  {
   printf("Found");
   break;
  }
  if(i==n)
  {
  printf("not found");
 }
}
getch();
}

Merge Sort

                                          Merge Sort

#include<stdio.h>
#include<conio.h>
void merge(int [],int ,int ,int );
void part(int [],int ,int );
int main()
{
 int arr[30];
 int i,size;
 printf("\n\t------- Merge sorting method -------\n\n");
 printf("Enter total no. of elements : ");
 scanf("%d",&size);
 for(i=0; i<size; i++)
 {
   printf("Enter %d element : ",i+1);
   scanf("%d",&arr[i]);
 }
 part(arr,0,size-1);
 printf("\n\t------- Merge sorted elements -------\n\n");
 for(i=0; i<size; i++)
 printf("%d ",arr[i]);
 getch();
 return 0;
}


void part(int arr[],int min,int max)
{
 int mid;
 if(min<max)
 {
   mid=(min+max)/2;
   part(arr,min,mid);
   part(arr,mid+1,max);
   merge(arr,min,mid,max);
 }
}


void merge(int arr[],int min,int mid,int max)
{
  int tmp[30];
  int i,j,k,m;
  j=min;
  m=mid+1;
  for(i=min; j<=mid && m<=max ; i++)
  {
     if(arr[j]<=arr[m])
     {
         tmp[i]=arr[j];
         j++;
     }
     else
     {
         tmp[i]=arr[m];
         m++;
     }
  }
  if(j>mid)
  {
     for(k=m; k<=max; k++)
     {
         tmp[i]=arr[k];
         i++;
     }
  }
  else
  {
     for(k=j; k<=mid; k++)
     {
        tmp[i]=arr[k];
        i++;
     }
  }
  for(k=min; k<=max; k++)
     arr[k]=tmp[k];
}

Quick Sort

                                        Quick Sort

#include<stdio.h>
#include<conio.h>
void qsort(int arr[20], int left, int right);
int main()
{
 int arr[30];
 int i,n;
 printf("Enter total no. of the elements : ");
 scanf("%d",&n);
 printf("Enter total %d elements : \n",size);
 for(i=0; i<n; i++)
    scanf("%d",&arr[i]);
 qsort(arr,0,n-1);
 printf("Quick sorted elements are as  : \n");
 for(i=0; i<n; i++)
    printf("%d\t",arr[i]);
 getch();
 return 0;
}
void qsort(int arr[20], int left, int right)
{
 int i,j,pivot,tmp;
 if(left<right)
 {
   pivot=left;
   i=left+1;
   j=right;
   while(i<j)
   {
     while(arr[i]<=arr[pivot] && i<right)
        i++;
     while(arr[j]>arr[pivot])
        j--;
     if(i<j)
     {
        tmp=arr[i];
        arr[i]=arr[j];
        arr[j]=tmp;
     }
   }
   tmp=arr[pivot];
   arr[pivot]=arr[j];
   arr[j]=tmp;
   qsort(arr,left,j-1);
   qsort(arr,j+1,right);
 }
}

Selection Sort

                                        Selection Sort

#include <stdio.h>
#include<conio.h>
void 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 using Selection sort:\n");

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

  getch();
}

Shell Sort

                                            Shell Sort

#include<stdio.h>
#include<conio.h>
int main()
{
 int arr[30];
 int i,j,k,tmp,num;
 printf("Enter total no. of elements : ");
 scanf("%d", &num);
 for(k=0; k<num; k++)
 {
   printf("\nEnter %d number : ",k+1);
   scanf("%d",&arr[k]);
 }
 for(i=num/2; i>0; i=i/2)
 {
   for(j=i; j<num; j++)
   {
     tmp=arr[j];
       for(k=j; k>=i; k=k-i)
     {
    if(tmp<arr[k-i])

         {
         arr[k]=arr[k-i];
        }
    else
    {
        break;
         }
         arr[k-i]=tmp;
       }
    }
     }
 printf("\t**** Shell Sorting ****\n");
 for(k=0; k<num; k++)
     printf("%d\t",arr[k]);
 getch();
 return 0;
}

Insertion Sort

                                            Insertion Sort

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

  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]);
  }

  for (j = 1 ; j < n; j++)
  {
    k=j ;

    while ( k> 0 && array[k] < array[k-1])
    {
      t          = array[k];
      array[k]   = array[k-1];
      array[k-1] = t;

      k--;
    }
  }

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

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