binary search java
// Java implementation of iterative Binary Search
class BinarySearch {
// Returns index of x if it is present in arr[],
// else return -1
int binarySearch(int arr[], int x)
{
int l = 0, r = arr.length - 1;
while (l <= r) {
int m = l + (r - l) / 2;
// Check if x is present at mid
if (arr[m] == x)
return m;
// If x greater, ignore left half
if (arr[m] < x)
l = m + 1;
// If x is smaller, ignore right half
else
r = m - 1;
}
// if we reach here, then element was
// not present
return -1;
}
// Driver method to test above
public static void main(String args[])
{
BinarySearch ob = new BinarySearch();
int arr[] = { 2, 3, 4, 10, 40 };
int n = arr.length;
int x = 10;
int result = ob.binarySearch(arr, x);
if (result == -1)
System.out.println("Element not present");
else
System.out.println("Element found at "
+ "index " + result);
}
}
Also in Java:
- throwing exceptions java
- java square a number
- java script print date in YYYY-MM-DD format
- init cap java
- rock paper scissors java
- set preference value android
- java xml element get attribute value
- how to take space separated input in java
- jframe border
- java android edit text set value
- get drawable with string android java
- mutable string in java
- how to copy all files and subdirectories in directory in java
- jbutton open jframe java
- how to compare current date and time with another date and time in android
- Unhandled exception: java.lang.InterruptedException
- java gateway process exited before sending its port number pyspark anaconda
- how to compare string in java
- how to create an abstract class in java
- replaceall in java
- arraylist with values java
- web app runtime for java
- how to do for each in java
- Enums injava