mirror
/
java-interview
mirror of https://github.com/enhorse/java-interview.git
1
1
Fork 0
Code

Oops, дубликация )))

This commit is contained in:
Arthur 2020-02-21 17:28:46 +03:00 committed by Enchased Horse
parent ea8888d046
commit 18012a0d0f
1 changed files with 0 additions and 54 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

54
jcf.md
View File

@ -649,60 +649,6 @@ public class Q {
return index;
}
}
import java.util.HashMap;
import java.util.IdentityHashMap;
import java.util.Map;
public class Q {
public static void main(String[] args) {
Q q = new Q();
q.binSearch();
}
private void binSearch() {
int inpArr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
Integer result = binSearchF(inpArr, 1, 0, inpArr.length - 1);
System.out.println("-----------------------");
result = binSearchF(inpArr, 2, 0, inpArr.length - 1);
System.out.println("Found at position " + result);
}
private Integer binSearchF(int inpArr[], int searchValue, int low, int high) {
Integer index = null;
while (low <= high) {
System.out.println("New iteration, low = " + low + ", high = " + high);
int mid = (low + high) / 2;
System.out.println("trying mid = " + mid + " inpArr[mid] = " + inpArr[mid]);
if (inpArr[mid] < searchValue) {
low = mid + 1;
System.out.println("inpArr[mid] (" + inpArr[mid] + ") < searchValue(" + searchValue + "), mid = " + mid
+ ", setting low = " + low);
} else if (inpArr[mid] > searchValue) {
high = mid - 1;
System.out.println("inpArr[mid] (" + inpArr[mid] + ") > searchValue(" + searchValue + "), mid = " + mid
+ ", setting high = " + high);
} else if (inpArr[mid] == searchValue) {
index = mid;
System.out.println("found at index " + mid);
break;
}
}
return index;
}
}
```
[к оглавлению](#java-collections-framework)