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

How to pass data from list to report?

955

---

How many types of tables exists and what are they in data dictionary? : abap data dictionary

1077

---

Explain read dataset in sap abap?

1172

---

Which one is better joins or views and why?

1038

---

Explain sap abap 3-tier architecture?

1181

---

What is the syntax for call transaction? : abap bdc

1011

---

What are the problems in processing batch input sessions? How is batch inputprocess different from processing online?

1009

---

What is the table buffer? Which type of tables used this buffer?

974

---

if while coding power goes off , how to retrieve the codes?

2034

---

What is the advantage of structures?

1040

---

Explain get cursor field?

1125

---

What are the functional areas, user groups? How does abap query work in relation to these?

1000

---

Explain the client concept of sap.

980

---

Kindly help me to Know the process of mapping in EDI from R/3 to a convertor(third party which translates IDoc flatfile to EDIFACT /XML / FTP /HTTP ) ?

1963

---

When will the current screen processing terminates?

993

---