diff --git a/src/main/java/com/ordestiny/tdd/algorithms/Linear Search b/src/main/java/com/ordestiny/tdd/algorithms/Linear Search
new file mode 100644
index 0000000..e431bad
--- /dev/null
+++ b/src/main/java/com/ordestiny/tdd/algorithms/Linear Search	
@@ -0,0 +1,33 @@
+// Java code for linearly searching x in arr[]. If x
+// is present then return its location, otherwise
+// return -1
+ 
+class GFG 
+{
+    public static int search(int arr[], int x)
+    {
+        int n = arr.length;
+        for (int i = 0; i < n; i++) 
+        {
+            if (arr[i] == x)
+                return i;
+        }
+        return -1;
+    }
+ 
+    // Driver code
+    public static void main(String args[])
+    {
+        int arr[] = { 2, 3, 4, 10, 40 };
+        int x = 10;
+ 
+        // Function call
+        int result = search(arr, x);
+        if (result == -1)
+            System.out.print(
+                "Element is not present in array");
+        else
+            System.out.print("Element is present at index "
+                             + result);
+    }
+}