diff --git a/Data Structure & Algorithm/Searching/linear.c b/Data Structure & Algorithm/Searching/linear.c
index d441414..263516d 100644
--- a/Data Structure & Algorithm/Searching/linear.c	
+++ b/Data Structure & Algorithm/Searching/linear.c	
@@ -1,4 +1,4 @@
-
+CODE OF LINEAR SEARCH WITHOUT USING FUNCTIONS 
 
 #include <stdio.h>
  
@@ -30,3 +30,46 @@ int main()
  
    return 0;
 }
+
+//LETS US ALSO INTRODUCE YOU CODE OF LINEARING SEARCHING WITH THE HELP OF FUNCTIONS //
+
+C program for linear search using a function
+#include <stdio.h>
+ 
+long linear_search(long [], long, long);
+ 
+int main()
+{
+   long array[100], search, c, n, position;
+ 
+   printf("Input number of elements in array\n");
+   scanf("%ld", &n);
+ 
+   printf("Input %d numbers\n", n);
+ 
+   for (c = 0; c < n; c++)
+      scanf("%ld", &array[c]);
+ 
+   printf("Input a number to search\n");
+   scanf("%ld", &search);
+ 
+   position = linear_search(array, n, search);
+ 
+   if (position == -1)
+      printf("%d isn't present in the array.\n", search);
+   else
+      printf("%d is present at location %d.\n", search, position+1);
+ 
+   return 0;
+}
+ 
+long linear_search(long a[], long n, long find) {
+   long c;
+ 
+   for (c = 0 ;c < n ; c++ ) {
+      if (a[c] == find)
+         return c;
+   }
+ 
+   return -1;
+}