Implementation for RotatedSortedArray Search 2D Matrix UnknowSizeSortedArray

ArrayReader.java

@@ -0,0 +1,5 @@
+public interface ArrayReader {
+    public default int get(int index) {
+        return Integer.MAX_VALUE;
+    }
+}

RotatedSortedArray.java

@@ -0,0 +1,33 @@
+public class RotatedSortedArray {
+
+    public int search(int[] nums, int target){
+        int low = 0;
+        int high = nums.length-1;
+        while(low < high){
+            int mid = low + (high - low)/2;
+            if(nums[mid] == target){
+                return mid;
+            }
+            else{
+                if(nums[low]<=nums[mid]){
+                    if(nums[low]>target && nums[mid]>target) {
+                        high = mid - 1;
+                    }
+                    else{
+                        low = mid + 1;
+                    }
+                }
+                else{
+                    if(nums[mid]<target && nums[high]>=target){
+                        low = mid + 1;
+                    }
+                    else{
+                        high = mid - 1;
+                    }
+                }
+            }
+        }
+        return -1;
+
+    }
+}

SearchTwoDMatrix.java

@@ -0,0 +1,26 @@
+public class SearchTwoDMatrix {
+    public boolean searchMatrix(int[][] matrix, int target) {
+        int low = 0;
+        int m = matrix.length;
+        int n = matrix[low].length;
+        int high = (m*n)-1;
+        while (low<=high){
+            int mid = low + (high-low)/2;
+            int row = mid/n;
+            int column = mid%n;
+            if(matrix[row][column] == target){
+                return true;
+            }
+            else{
+                if(matrix[row][column]<target){
+                    low = mid + 1;
+                }
+                else {
+                    high = mid - 1;
+                }
+            }
+
+        }
+        return false;
+    }
+}

UnknownSizeSortedArray.java

@@ -0,0 +1,29 @@
+class UnknownSizeSortedArray {
+    public int search(ArrayReader reader, int target) {
+        int low = 0;
+        int high = 1;
+
+        while(low<=high){
+            int mid = low + (high - low)/2;
+            if(reader.get(mid) == target){
+                return mid;
+            }
+            else{
+                if(target < reader.get(mid)){
+                    high = mid - 1;
+                }
+                else if(reader.get(high)>target){
+                    low = mid + 1;
+                }
+                else {
+                    low = high;
+                    high = 2 * high;
+
+                }
+            }
+        }
+
+        return -1;
+
+    }
+}