Answer Posted / jamshed
SHORTEST BINARY SEARCH PROGRAM
import java.io.*;
class Binary
{
public static void main()throws IOException
{
InputStreamReader isr=new
InputStreamReader(System.in);
BufferedReader br=new BufferedReader(isr);
int a[]={5,7,9,11,15,20,30,45,89,97};
int n,c=0,l=0,u=9,m;
System.out.println("Enter a Number to Search");
n=Integer.parseInt(br.readLine());
while(u>l)
{
m=(l+u)/2;
if(a[m]==n)
{
c++;
break;
}
else if(a[m]>n)
u=m;
else if(a[m]<n)
l=m+1;
}
if(c==0)
System.out.println("Not Found");
else
System.out.println("Found");
}
}
| Is This Answer Correct ? | 14 Yes | 4 No |
Post New Answer View All Answers
What is a weighted graph?
What's difference between stack and queue?
Explain what are the major data structures used in the network data model?
What are threaded binary trees?
What is array and structure?
What is a simple graph?
What is time and space complexity of bubble sort?
What does bubble sort do?
Write the recursive c function to count the number of nodes present in a binary tree.
Differentiate null and void?
Can hashmap have same key?
Define a relation?
In an avl tree, at explain what condition the balancing is to be done?
What does a bubble chart show?
By Which algorithm, the 8 queens problem is solved?
