Commit 2aea536

committed

binary search implements

1 parent e13a6ea commit 2aea536Copy full SHA for 2aea536

File tree

+11

-3

lines changed

+11

-3

lines changed

Lines changed: 11 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,8 +2,8 @@`
`2`	`2`	`class binarySearch {`
`3`	`3`
`4`	`4`	`public static void main(String[] args) {`
`5`		`- int[] arr = {3, 5, 7, 9, 11, 13, 15, 17};`
`6`		`- int target_item = 13;`
	`5`	`+ int[] arr = {3, 5, 7, 9, 11, 13, 15, 17,19,21,23,25,27,29,31,33,35,37,39,41,43,45,47,49};`
	`6`	`+ int target_item = 43;`
`7`	`7`	`int result = binarySearching(arr, target_item);`
`8`	`8`
`9`	`9`	`if (result != -1) {`
`@@ -14,18 +14,26 @@ public static void main(String[] args) {`
`14`	`14`	`}`
`15`	`15`
`16`	`16`	`public static int binarySearching(int[] a, int target) {`
	`17`	`+ int step = 0;`
`17`	`18`	`int left = 0;`
`18`	`19`	`int right = a.length - 1;`
`19`	`20`	`while (left <= right) {`
	`21`	`+ step++;`
`20`	`22`	`int mid = (left + right) / 2;`
`21`	`23`	`if (a[mid] == target) {`
	`24`	`+ System.out.println("Total steps: " + step);`
`22`	`25`	`return mid;`
	`26`	`+`
`23`	`27`	`} else if (a[mid] < target) {`
`24`	`28`	`left = mid + 1;`
`25`		`- }else{`
	`29`	`+`
	`30`	`+ } else {`
`26`	`31`	`right = mid - 1;`
`27`	`32`	`}`
	`33`	`+`
`28`	`34`	`}`
	`35`	`+`
`29`	`36`	`return -1;`
	`37`	`+`
`30`	`38`	`}`
`31`	`39`	`}`

Comments

(0)