Java Assignment.Implement a binary search algorithm on an array..pdf
0 likes7 views
The document contains a Java assignment that involves implementing a binary search algorithm on an array. The code prompts the user for the number of elements, takes an array of integers, and searches for a specific value using the binary search method. It also provides output indicating whether the value was found and its location in the array.
1 of 2
Download to read offline
![Java Assignment.
Implement a binary search algorithm on an array.
Solution
import java.util.Scanner;
class BinarySearch
{
public static void main(String args[])
{
int c, first, last, middle, n, search, array[];
Scanner in = new Scanner(System.in);
System.out.println("Enter number of elements");
n = in.nextInt();
array = new int[n];
System.out.println("Enter " + n + " integers");
for (c = 0; c < n; c++)
array[c] = in.nextInt();
System.out.println("Enter value to find");
search = in.nextInt();
first = 0;
last = n - 1;
middle = (first + last)/2;
while( first <= last )
{
if ( array[middle] < search )
first = middle + 1;
else if ( array[middle] == search )
{
System.out.println(search + " found at location " + (middle + 1) + ".");
break;
}
else
last = middle - 1;
middle = (first + last)/2;](https://image.slidesharecdn.com/javaassignment-230707211126-cf2a0876/85/Java-Assignment-Implement-a-binary-search-algorithm-on-an-array-pdf-1-320.jpg)
More Related Content
Similar to Java Assignment.Implement a binary search algorithm on an array..pdf (20)
Ad
More from irshadoptical (20)
Ad
Recently uploaded (20)
Java Assignment.Implement a binary search algorithm on an array..pdf
- 1. Java Assignment. Implement a binary search algorithm on an array. Solution import java.util.Scanner; class BinarySearch { public static void main(String args[]) { int c, first, last, middle, n, search, array[]; Scanner in = new Scanner(System.in); System.out.println("Enter number of elements"); n = in.nextInt(); array = new int[n]; System.out.println("Enter " + n + " integers"); for (c = 0; c < n; c++) array[c] = in.nextInt(); System.out.println("Enter value to find"); search = in.nextInt(); first = 0; last = n - 1; middle = (first + last)/2; while( first <= last ) { if ( array[middle] < search ) first = middle + 1; else if ( array[middle] == search ) { System.out.println(search + " found at location " + (middle + 1) + "."); break; } else last = middle - 1; middle = (first + last)/2;
- 2. } if ( first > last ) System.out.println(search + " is not present in the list. "); } }