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");
}
}

Which is the fastest sorting?

982

---

Is arraylist better than array?

933

---

Differentiate between the singly linked list and doubly linked list.

981

---

Why do we need sorting?

839

---

What are linked list?

942

---

What is int data type?

935

---

Is hashset thread safe?

977

---

Explain about the different lists available in the collection?

860

---

What do you mean by balanced trees?

1012

---

You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?

1099

---

What is lifo?

1395

---

What are the disadvantages of linked list over array?

899

---

Which sorting algorithm is worst?

889

---

What is stable sorting?

865

---

What are trees in data structures?

917

---