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

Is merge sort better than quick?

852

---

What is collections singletonmap?

813

---

What is sorting with example?

840

---

What is the use of substring?

889

---

Why is hashmap faster than treemap?

858

---

What is entryset in hashmap?

866

---

Can you sort a hashset?

871

---

Explain the Linked List

1066

---

What is bubble sort algorithm?

915

---

What is list and types of list?

812

---

Can hashmap be sorted?

872

---

Is it possible to increase size of array?

905

---

What is a data structure definition?

906

---

Which is faster arraylist or hashmap?

937

---

What is the time complexity of hashmap get () and put () method?

834

---