We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 7b29020 commit 08aaa5eCopy full SHA for 08aaa5e
1 file changed
GeeksForGeeks/SearchInInfiniteSortedArray.java
@@ -20,7 +20,7 @@ static int ans(int nums[],int target){
20
return infiniteArray(nums,target,start,end);
21
}
22
//once we find the start and end of the range by above function we can apply normal binary search and find the position of given element;
23
- //if the target element is not there in the array the funcion will return -1;
+ //if the target element is not there in the array the funcion will return -1;
24
static int infiniteArray(int nums[],int target,int start ,int end){
25
26
0 commit comments