Answer Posted / saplead.sai

The solution provided by Siddhart is though correct, I
would like to project the solution in a much detailed with
example.
Binary Search Basic rule - Sort the data in Ascending order.
Suppose we have random numbers ranging from 1 to 10000 and
we are searching for 4219. If the data is unorganized and
random....a sequential search would be time consuming.
Hence once the data is sorted in Ascending order. Binary
search would reduce the LOOKUP time.
In the FIRST PASS BINARY search would split the range of 1 -
10000 in to two halfs (i.e 1 - 4999 & 5000 - 10000) and
compares the 4219 which happens to fall in the first half.
In the next pass again two halfs are made and compared.
This way BINARY SEARCH works by dividing either data into
two halfs.
For internal table......or for anything else....this is it

What is bdc programming in sap?

1108

---

In which cluster time results are stored? : abap hr

1064

---

What are the page headers for secondary lists?

1043

---

If I want to execute a bdc program only in background not in foreground is there any option for this? : abap bdc

1073

---

What are the two ways for restricting the value range for a domain? : sap abap data dictionary

1284

---

What are logical databases? : abap hr

1147

---

Explain the relationship between a functional area, user group, and query when developing queries using the sap query tool?

1015

---

How to create any functions? How to go about it?

1101

---

What is the difference between field-group header and other field groups? : abap modularization

985

---

Which infotype records can not be deleted ? : abap hr

1088

---

How the at-user command serves mainly in lists?

1089

---

how to create view in bdc..??

2819

---

Did you use buffering?

1087

---

any one can tell me which is the tables can store in ddic plese dont say db02l,please give me different ways of resideing the tables ?

2487

---

Can you assign a matchcode object to a parameter? If so how?

1041

---