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

Define static data structures?

997

---

Can a stack be described as a pointer? Explain.

924

---

Given M x N matrix with sorted elements row wise and column wise, find elements?

981

---

Does treemap allow null key?

861

---

How many sorting algorithms are there?

996

---

State the rules to be followed during infix to prefix conversions?

1047

---

Suppose in an integer array, there is 1 to 100 number, out of one is duplicate, how to find?

968

---

What do you mean by an Array?

946

---

What is the space complexity of bubble sort?

978

---

What is the relationship between a queue and its underlying array?

1270

---

What is selection sort with example?

977

---

What is the difference between hashmap and linkedhashmap?

926

---

Does treemap allow null values?

860

---

Explain set interface?

1086

---

Why do we use arrays?

906

---