GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing github.com — Formatted with Google Java Formatter · JavaInCloud/Java@8cece6c

File tree

Expand file treeCollapse file tree

Open diff view settings

Filter options

Searches
- BinarySearch.java

Expand file treeCollapse file tree

Open diff view settings

Collapse file

`‎Searches/BinarySearch.java‎`

Copy file name to clipboardExpand all lines: Searches/BinarySearch.java

+1-1Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -45,7 +45,7 @@ private <T extends Comparable<T>> int search(T array[], T key, int left, int rig`
`45`	`45`	`if (right < left) return -1; // this means that the key not found`
`46`	`46`
`47`	`47`	`// find median`
`48`		`- int median = left + ((right-left) >>> 1);`
	`48`	`+ int median = left + ((right - left) >>> 1);`
`49`	`49`	`int comp = key.compareTo(array[median]);`
`50`	`50`
`51`	`51`	`if (comp == 0) {`

0 commit comments

Comments

0 (0)

You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.