diff --git a/README.md b/README.md
index 306eb5f3..5f282f45 100644
--- a/README.md
+++ b/README.md
@@ -367,8 +367,8 @@ In order to achieve greater coverage and encourage more people to contribute to
                 </a>
             </td>
             <td> <!-- Java -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="./logos/github.svg" />
+                <a href="./src/java/LinearSearchRecursive.java">
+                    <img align="center" height="25" src="./logos/java.svg" />
                 </a>
             </td>
             <td> <!-- Python -->
@@ -425,8 +425,8 @@ In order to achieve greater coverage and encourage more people to contribute to
                 </a>
             </td>
             <td> <!-- Java -->
-                <a href="./CONTRIBUTING.md">
-                    <img align="center" height="25" src="./logos/github.svg" />
+                <a href="./src/java/SentinelLinearSearch.java">
+                    <img align="center" height="25" src="./logos/java.svg" />
                 </a>
             </td>
             <td> <!-- Python -->
diff --git a/src/java/LinearSearchRecursive.java b/src/java/LinearSearchRecursive.java
new file mode 100644
index 00000000..22881459
--- /dev/null
+++ b/src/java/LinearSearchRecursive.java
@@ -0,0 +1,17 @@
+public class LinearSearchRecursive {
+    public static void main(String[] args) {
+        int[] arr = {10,20,50,60,30,60,70,80,22,56,2,7,9,0,44};
+        System.out.println(LinearRecursive(arr, 0, 9));
+        System.out.println(LinearRecursive(arr, 0, 45));
+    }
+
+    public static int LinearRecursive(int[] arr, int i, int key){
+        
+        if(i<arr.length){
+            if(arr[i] == key) return i;
+            else return LinearRecursive(arr, i+1, key);
+        }
+
+        return -1;
+    }
+}
diff --git a/src/java/SentinelLinearSearch.java b/src/java/SentinelLinearSearch.java
new file mode 100644
index 00000000..6eba6bba
--- /dev/null
+++ b/src/java/SentinelLinearSearch.java
@@ -0,0 +1,32 @@
+public class SentinelLinearSearch {
+    public static void main(String[] args){
+        int[] arr = {10,20,50,60,30,60,70,80,22,56,2,7,9,0,44};
+        System.out.println(LinearSentinel(arr,70));
+        System.out.println(LinearSentinel(arr,45));
+    }   
+
+    public static int LinearSentinel(int[] arr, int key){
+
+        int n = arr.length;
+        
+        // Storing last element.
+        int last = arr[n-1];
+
+        // Adding key at end index + 1
+        arr[n-1] = key;
+
+        int i = 0;
+        for(i = 0; i<n;i++){
+            if(arr[i] == key) break;
+        }
+
+        // Restoring the last element
+        arr[n-1] = last;
+
+        // Returning index when found.
+        if((i<n-1) || arr[n-1] == key){ return i;}
+        
+        // Returning -1 if not found
+        else return -1;
+    }
+}
\ No newline at end of file