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

Which sorting technique is faster?

881

---

What is data structure and data type?

945

---

“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?

1188

---

Is heap sort faster than quicksort?

812

---

What is the two-dimensional array?

1005

---

Do you know what is linear search?

884

---

Mention the data structures which are used in graph implementation.

868

---

What is peek in stack?

921

---

Does hashset allow duplicates?

1062

---

Name few concurrent collection classes?

895

---

Which sorting is used in collections sort?

862

---

How do you access the values within an array?

1059

---

What is binary tree give example?

908

---

What is the best case for bubble sort?

853

---

How to compare Two Arrays?

1002

---