Updated Pr for BS1

src/Matrixd.java

@@ -0,0 +1,29 @@
+// Time Complexity :O(mn)
+// Space Complexity :O(1)
+class Matrixd{
+
+	public boolean searchMatrix(int [][]matrix,int target) {
+
+	int m =matrix.length;
+	int n=matrix[0].length;
+
+	int l=0; int r =m*n-1;
+	int mid= l+(r-l)/2;
+	while(left<right) {
+		int midelement =matrix[mid/n][mid%n];
+		if(target=midelement) {
+			return true;
+		}
+		else {
+			if(target<midelement) {
+				return r=mid-1;
+			}
+			else {
+				return l=mid+1;
+			}
+		}
+	}
+	return false;
+
+	}	
+}

src/SearchRS.java

@@ -0,0 +1,48 @@
+
+public class SearchRS {
+
+
+	public int search(int []nums,int target) {
+		int n =nums.length();
+		int l;int r =n-1;
+		while(l<r) {
+			int mid= l+(r-l)/2;
+			if(nums[mid]>r) {
+				return l=mid+1;
+			}
+			else {
+				return r=mid-1;
+			}
+		}
+
+		int values = binarySearch(int []nums,0,left-1,target);
+		if (values!=-1) {
+			return values;
+		}
+		return binarySearch(int []nums,left,n-1,target);
+
+		public int binarySearch (int []nums,left,right,target) {
+
+        {
+	        int l = left, r = right;
+	        while (l <= r) {
+	            int mid = (l + r) / 2;
+	            if (nums[mid] == target) {
+	                return mid;
+	            } else if (nums[mid] > target) {
+	                r = mid - 1;
+	            } else {
+	                l = mid + 1;
+	            }
+	        }
+	        return -1;
+
+
+		}
+
+
+
+
+	}
+
+}

src/SearchUnknownSizeArray.java

@@ -0,0 +1,29 @@
+//Time O(log n)
+//space O(1)
+public class SearchUnknownSizeArray {
+
+	public int search(ArrayReader reader, int target) {
+        int index = 1;
+        while (reader.get(index) < target) {
+            index *= 2;
+        }
+
+        int left = index / 2;
+        int right = index;
+
+        while (left <= right) {
+            int mid = left + (right - left) / 2;
+            int val = reader.get(mid);
+
+            if (val == target) {
+                return mid;
+            } else if (val > target || val == Integer.MAX_VALUE) {
+                right = mid - 1;
+            } else {
+                left = mid + 1;
+            }
+        }
+        return -1; 
+    }
+
+}