Answer Posted / shah varshil

#include<stdio.h>

main()
{
int c, first, last, middle, n, search, array[100];

printf("Enter number of elements\n");
scanf("%d",&n);

printf("Enter %d integers\n", n);

for ( c = 0 ; c < n ; c++ )
scanf("%d",&array[c]);

printf("Enter value to find\n");
scanf("%d",&search);

first = 0;
last = n - 1;
middle = (first+last)/2;

while( first <= last )
{
if ( array[middle] < search )
first = middle + 1;
else if ( array[middle] == search )
{
printf("%d found at location %d.\n", search, middle
+1);
break;
}
else
last = middle - 1;

middle = (first + last)/2;
}
if ( first > last )
printf("Not found! %d is not present in the list.\n",
search);

return 0;
}

What thread means?

888

---

What are the topics in data structures?

999

---

What do you mean by disjoint set adt?

971

---

How do you find the length of an arraylist?

906

---

How many types of data structure are there?

873

---

Is array a data structure?

987

---

What is the use of isEmpty() member methods?

971

---

How do you empty an arraylist?

971

---

What is the difference between array sort () and array sort t >()?

837

---

What is a directed graph?

937

---

Which sort is stable?

934

---

What is vector and types of vector?

1018

---

How many sorting techniques are there?

852

---

How is a hashset implemented?

923

---

Define a priority queue?

1104

---