diff --git a/C/linear_search.c b/C/linear_search.c
new file mode 100644
index 0000000..0f9a511
--- /dev/null
+++ b/C/linear_search.c
@@ -0,0 +1,28 @@
+// C code to linearly search x in arr[]. If x 
+// is present then return its location, otherwise 
+// return -1 
+
+#include <stdio.h> 
+int search(int arr[], int n, int x) 
+{ 
+	int i; 
+	for (i = 0; i < n; i++)
+  {
+		if (arr[i] == x) 
+			return i;
+    else
+	    return -1; 
+   }
+ }
+int main() 
+{ 
+	int arr[] = { 2, 3, 4, 10, 40 }; 
+	int x = 10; 
+	int n = sizeof(arr) / sizeof(arr[0]); 
+	int result = search(arr, n, x); 
+	if (result == -1)
+  printf("Element is not present in array");
+  else
+	printf("Element is present at index %d",result); 
+	return 0; 
+}