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

Define internal nodes?

923

---

Explain the principle of quicksort. What is its complexity?

1056

---

State the different types of linked lists?

945

---

Why do we need searching algorithms?

1085

---

Is linkedlist thread safe?

870

---

What is the complexity of sorting algorithm?

884

---

What is data structure? Explain.

992

---

What data type is enum?

913

---

What is a static structure?

954

---

How does bogo sort work?

987

---

What does quick sort do?

875

---

What is stable sort example?

869

---

Can we use ordered set for performing binary search?

915

---

What is faster array or arraylist?

899

---

How do you sort an arraylist in descending order?

796

---