Jump to content
Main menu
Main menu
move to sidebar
hide
Social
Discord
Facebook
Twitter
Explore
Languages
Tasks
Random page
Rosetta Code
Search
Search
Create account
Log in
Personal tools
Dark mode
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Binary search: Difference between revisions
Page
Discussion
English
Read
View source
View history
Tools
Tools
move to sidebar
hide
Actions
Read
View source
View history
Refresh
General
Special pages
Printable version
Get shortened URL
← Older edit
Newer edit →
Binary search
(view source)
Revision as of 06:47, 8 November 2007
526 bytes removed
,
16 years ago
→Iterative
Revision as of 06:45, 8 November 2007
(
view source
)
rosettacode>Mwn3d
m
(Forgot the task tag)
← Older edit
Revision as of 06:47, 8 November 2007
(
view source
)
rosettacode>Mwn3d
(
→Iterative
)
Newer edit →
Line 33:
==[[Java]]==
[[Category:Java]]
==Iterative==
...
//check will be the number we are looking for
//nums will be the array we are searching through
int hi = nums.length - 1;
int lo = 0;
int guess = (hi + lo) / 2;
while((nums[guess] != check) && (hi > lo)){
if(nums[guess] > check){
hi = guess - 1;
}else if(nums[guess] < check){
lo = guess + 1;
}
guess = (hi + lo) / 2;
}
if(hi < lo){
System.out.println(check + " not in array");
}else{
System.out.println("found " + nums[guess] + " at index " + guess);
}
...
Anonymous user
rosettacode>Mwn3d
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information
OK
Toggle limited content width