a

Author: chirag127

daa/1. Program for Recursive Binary & Linear Search./rbls

@@ -37,16 +37,21 @@ int main()
         scanf("%d", &a[i]);
     printf("Enter the key : ");
     scanf("%d", &key);
-    
-    pos = binary_search(a, 0, n - 1, key);
-    if (pos == -1)
-        printf("Key not found");
+
+    printf("enter search type 1 for binary search and 2 for linear search : ");
+    scanf("%d", &i);
+
+    if (i == 1)
+        pos = binary_search(a, 0, n - 1, key);
     else
-        printf("Key found at position %d", pos + 1);
-    pos = linear_search(a, n, key);
+        pos = linear_search(a, n, key);
+
     if (pos == -1)
         printf("Key not found");
+
     else
+
         printf("Key found at position %d", pos + 1);
     return 0;
+
 }

daa/1. Program for Recursive Binary & Linear Search./rbls.c

@@ -4,35 +4,21 @@
 
 int main()
 {
-    int  a[100], n, i, j, temp;
-
-    printf("The program for the heap sort in c \n written by Chirag Singhal \n roll number 2000330100084 \n");
-
-    printf( "Enter the number of elements : " );
-
-
-    scanf( "%d" , &n);
-    printf( "Enter the elements : " );
-
-
-    for (i = 0; i < n; i++)
-        scanf( "%d" , &a[i]);
-    for (i = 0; i < n; i++)
+    int  a[3]={4,3,5}, n, i, j, t;
+    n=3;
+    for (i = 1; i < n; i++)
     {
-        for (j = 0; j < n - i - 1; j++)
+        t = a[i];
+        j = i - 1;
+        while (j >= 0 && a[j] > t)
         {
-            if (a[j] > a[j + 1])
-            {
-                temp = a[j];
-                a[j] = a[j + 1];
-                a[j + 1] = temp;
-            }
+            a[j + 1] = a[j];
+            j--;
         }
+        a[j + 1] = t;
     }
-    printf( "Sorted array is : " );
+    printf("Sorted elements are: ");
     for (i = 0; i < n; i++)
-        printf( "%d " , a[i]);
-
-    printf("\n");
-    return  0;
+        printf(" %d", a[i]);
+    return 0;
 }

daa/2. Program for Heap Sort./hs

@@ -2,33 +2,68 @@
 
 #include<stdio.h>
 
-int main()
+void merge(int a[], int low, int mid, int high)
 {
-    int  a[100], n, i, j, temp;
-
-    printf("This is the program for the merge sort in c \n written by Chirag Singhal \n roll number 2000330100084 \n");
-
-    printf( "Enter the number of elements : " );
-    scanf( "%d" , &n);
-    printf( "Enter the elements : " );
-    for (i = 0; i < n; i++)
-        scanf( "%d" , &a[i]);
-    for (i = 0; i < n; i++)
+    int i, j, k, c[50];
+    i = low;
+    k = low;
+    j = mid + 1;
+    while (i <= mid && j <= high)
     {
-        for (j = 0; j < n - i - 1; j++)
+        if (a[i] < a[j])
         {
-            if (a[j] > a[j + 1])
-            {
-                temp = a[j];
-                a[j] = a[j + 1];
-                a[j + 1] = temp;
-            }
+            c[k] = a[i];
+            k++;
+            i++;
+        }
+        else
+        {
+            c[k] = a[j];
+            k++;
+            j++;
         }
     }
-    printf( "Sorted array is : " );
-    for (i = 0; i < n; i++)
-        printf( "%d " , a[i]);
+    while (i <= mid)
+    {
+        c[k] = a[i];
+        k++;
+        i++;
+    }
+    while (j <= high)
+    {
+        c[k] = a[j];
+        k++;
+        j++;
+    }
+    for (i = low; i < k; i++)
+    {
+        a[i] = c[i];
+    }
+}
 
-    printf("\n");
-    return  0;
+void merge_sort(int a[], int low, int high)
+{
+    int mid;
+    if (low < high)
+    {
+        mid = (low + high) / 2;
+        merge_sort(a, low, mid);
+        merge_sort(a, mid + 1, high);
+        merge(a, low, mid, high);
+    }
+}
+
+int main()
+{
+    int a[30], n, i;
+    printf("Enter the number of elements : ");
+    scanf("%d", &n);
+    printf("Enter the elements : ");
+    for (i = 0; i < n; i++)
+        scanf("%d", &a[i]);
+    merge_sort(a, 0, n - 1);
+    printf("Sorted array is : ");
+    for (i = 0; i < n; i++)
+        printf(" %d", a[i]);
+    return 0;
 }

daa/2. Program for Heap Sort./hs.c

@@ -1,34 +1,42 @@
-// write a program for the selection sort in c
+// C program for implementation of selection sort
+#include <stdio.h>
 
-#include<stdio.h>
-
-int main()
+void s(int *xp, int *yp)
 {
-    int  a[100], n, i, j, temp;
+    int t = *xp;
+    *xp = *yp;
+    *yp = t;
+}
 
-    printf("This is the program for the selection sort in c \n written by Chirag Singhal \n roll number 2000330100084 \n");
 
-    printf( "Enter the number of elements : " );
-    scanf( "%d" , &n);
-    printf( "Enter the elements : " );
-    for (i = 0; i < n; i++)
-        scanf( "%d" , &a[i]);
-    for (i = 0; i < n; i++)
+void ss(int a[], int n)
+{
+    int i, j, mi;
+    for (i = 0; i < n-1; i++)
     {
-        for (j = 0; j < n - i - 1; j++)
-        {
-            if (a[j] > a[j + 1])
-            {
-                temp = a[j];
-                a[j] = a[j + 1];
-                a[j + 1] = temp;
-            }
-        }
+        mi = i;
+        for (j = i+1; j < n; j++)
+          if (a[j] < a[mi])
+            mi = j;
+        s(&a[mi], &a[i]);
     }
-    printf( "Sorted array is : " );
-    for (i = 0; i < n; i++)
-        printf( "%d " , a[i]);
 
+}
+
+void pa(int a[], int size)
+{
+    int i;
+    for (i=0; i < size; i++)
+        printf("%d ", a[i]);
     printf("\n");
-    return  0;
 }
+
+int main()
+{
+    int a[] = {64, 25, 12, 22, 11};
+    int n = sizeof(a)/sizeof(a[0]);
+    ss(a, n);
+    printf("Sorted array: \n");
+    pa(a, n);
+    return 0;
+}

daa/3. Program for Merge Sort./ms

@@ -1,34 +1,36 @@
 // write a `program for the insertion sort in c`
+#include <stdio.h>
 
-#include<stdio.h>
-
-int main()
+void is(int a[], int n) /* function to sort an aay with insertion sort */
 {
-    int  a[100], n, i, j, temp;
-
-    printf("This is the program for the insertion sort in c \nwritten by Chirag Singhal \nroll number 2000330100084 \n");
+    int i, j, t;
+    for (i = 1; i < n; i++) {
+        t = a[i];
+        j = i - 1;
 
-    printf( "Enter the number of elements : " );
-    scanf( "%d" , &n);
-    printf( "Enter the elements : " );
-    for (i = 0; i < n; i++)
-        scanf( "%d" , &a[i]);
-    for (i = 0; i < n; i++)
-    {
-        for (j = 0; j < n - i - 1; j++)
+        while(j>=0 && t <= a[j])  /* Move the elements greater than t to one position ahead from their current position*/
         {
-            if (a[j] > a[j + 1])
-            {
-                temp = a[j];
-                a[j] = a[j + 1];
-                a[j + 1] = temp;
-            }
+            a[j+1] = a[j];
+            j = j-1;
         }
+        a[j+1] = t;
     }
-    printf( "Sorted array is : " );
+}
+
+void pa(int a[], int n) /* function to print the array */
+{
+    int i;
     for (i = 0; i < n; i++)
-        printf( "%d " , a[i]);
+        printf("%d ", a[i]);
+}
+
+int main()
+{
+    int a[] = { 12, 31, 25, 8, 32, 17 };
+    int n = sizeof(a) / sizeof(a[0]);
+    is(a, n);
+    printf("\nAfter sorting array elements are - \n");
+    pa(a, n);
 
-    printf("\n");
-    return  0;
-}
+    return 0;
+}