From 18012a0d0f9eee0f73ecce93b92a0d32e00265fe Mon Sep 17 00:00:00 2001 From: Arthur Date: Fri, 21 Feb 2020 17:28:46 +0300 Subject: [PATCH] =?UTF-8?q?Oops,=20=D0=B4=D1=83=D0=B1=D0=BB=D0=B8=D0=BA?= =?UTF-8?q?=D0=B0=D1=86=D0=B8=D1=8F=20)))?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- jcf.md | 54 ------------------------------------------------------ 1 file changed, 54 deletions(-) diff --git a/jcf.md b/jcf.md index 7d9034c..1e72b4d 100644 --- a/jcf.md +++ b/jcf.md @@ -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)