Made the code short and easy to understand (hacktoberfest17#1040)

removed the extra , unnecessary lines & implemented the core logic .

Author: uditkumar489

searching/linear_search/c/linear_search.c

@@ -1,35 +1,30 @@
 #include <stdio.h>
 
-void main()
+int main()
 {
-    int array[10];
-    int i, num, keynum, found = 0;
+   int array[100], search, c, n;
 
-    printf("Enter the value of num \n");
-    scanf("%d", &num);
-    printf("Enter the elements one by one \n");
-    for (i = 0; i < num; i++)
-    {
-        scanf("%d", &array[i]);
-    }
-    printf("Input array is \n");
-    for (i = 0; i < num; i++)
-    {
-        printf("%dn", array[i]);
-    }
-    printf("Enter the element to be searched \n");
-    scanf("%d", &keynum);
-    /*  Linear search begins */
-    for (i = 0; i < num ; i++)
-    {
-        if (keynum == array[i] )
-        {
-            found = 1;
-            break;
-        }
-    }
-    if (found == 1)
-        printf("Element is present in the array\n");
-    else
-        printf("Element is not present in the array\n");
-}
+   printf("Enter the number of elements in array\n");
+   scanf("%d",&n);
+ 
+   printf("Enter %d integer(s)\n", n);
+ 
+   for (c = 0; c < n; c++)
+      scanf("%d", &array[c]);
+ 
+   printf("Enter the number to search\n");
+   scanf("%d", &search);
+ 
+   for (c = 0; c < n; c++)
+   {
+      if (array[c] == search)     /* if required element found */
+      {
+         printf("%d is present at location %d.\n", search, c+1);
+         break;
+      }
+   }
+   if (c == n)
+      printf("%d is not present in array.\n", search);
+ 
+   return 0;
+}