Answer Posted / nipesh.....janghel....bca..2nd

Binary Search
The binary search is the standard method for searching
through a sorted array. It is
much more efficient than a linear search, where we pass
through the array elements in
turn until the target is found. It does require that the
elements be in order.
The binary search repeatedly divides the array in two, each
time restricting the search to
the half that should contain the target element.
In this example, we search for the integer 5 in the 10-
element array below:

2 : 5 : 6 : 8 : 10 : 12 : 15 : 18 : 20 : 21

Loop 1 - Look at whole array
Low index = 0, high index = 9
Choose element with index (0+9)/2 = 4
Compare value (10) to target
10 is greater than 5, so the target must be in the lower
half of the array
Set high index = (4-1) = 3
Loop 2
Low index = 0, high index = 3
Choose element with index (0+3)/2 = 1
Compare value (5) to target
5 is equal to target
Target was found, index = 1

Explain about set and their types in a collection?

915

---

Is copyonwritearraylist thread safe?

918

---

There are 2 int type array data type. One is containing 50 elements, and another one is containing 30 elements. Can we assign the array of 50 elements to an array of 30 elements?

1329

---

How does variable declaration affect memory allocation?

1805

---

What are data and data types?

1114

---

What do you mean by data types?

1009

---

Is list a data type?

954

---

Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?

959

---

What is the family trees and connection by clause?

939

---

Is quicksort faster than merge sort?

942

---

Why linked lists are better than arrays?

1002

---

What are the types of map?

981

---

Tell me why can't constant values be used to define an array's initial size

973

---

What are the different types of data type?

1000

---

What is the difference between arrays sort and collections sort?

835

---