NotificationsYou must be signed in to change notification settings
Fork0
Star1

Commitd2d5efd

authored

BinarySearch: clearer median computation (TheAlgorithms#2182)

* BinarySearch: clearer median computation">>> 1" is simply too obscure...* update binary searchCo-authored-by: Yang Libin <contact@yanglibin.info>Co-authored-by: Du Yuanchao <shellhub.me@gmail.com>Co-authored-by: Yang Libin <contact@yanglibin.info>

1 parent02fab66 commitd2d5efdCopy full SHA for d2d5efd

File tree

1 file changed

-1

lines changed

Searches
- BinarySearch.java

1 file changed

-1

lines changed

`‎Searches/BinarySearch.java‎`

Lines 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`		`-intmedian =left +((right -left) >>>1);`
	`48`	`+intmedian =(left +right) >>>1;`
`49`	`49`	`intcomp =key.compareTo(array[median]);`
`50`	`50`
`51`	`51`	`if (comp ==0) {`

0 commit comments

Comments

(0)

Movatterモバイル変換

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commitd2d5efd

File tree

1 file changed

1 file changed

`‎Searches/BinarySearch.java‎`

0 commit comments