dynamic memory allocation in linear_search.c

abiduzz420 · abiduzz420 · commit 982a0752e3f2 · 2017-11-24T11:22:34.000+05:30
diff --git a/search/linear_search.c b/search/linear_search.c
@@ -1,29 +1,30 @@
 #include <stdio.h>
- 
+#include <stdlib.h>
 int main()
 {
-   int array[100], search, c, n;
+   int *array, search, c, n_terms;
  
    printf("Enter the number of elements in array\n");
-   scanf("%d",&n);      // Total no of elements
+   scanf("%d",&n_terms);      // Total no of elements
  
-   printf("Enter %d integer(s)\n", n);
+   array = (int*)malloc(sizeof(int)*n_terms);
+   printf("Enter %d integer(s)\n", n_terms);
  
-   for (c = 0; c < n; c++)
+   for (c = 0; c < n_terms; c++)
       scanf("%d", &array[c]);    //  Reading the elements
  
    printf("Enter the number to search\n");   // Target element to be searched
    scanf("%d", &search);
  
-   for (c = 0; c < n; c++)
+   for (c = 0; c < n_terms; c++)
    {
       if (array[c] == search)     /* if required element found */
       {
          printf("%d is present at location %d.\n", search, c+1);
          break;
       }
    }
-   if (c == n)
+   if (c == n_terms)
       printf("%d is not present in array.\n", search);   // Element not found
  
    return 0;
