Answer / 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

Answer / siddharth samal

IT DIVIDES THE SEARCH CRITERIA INTO TWO PARTS SO 1ST IT
SEARCH FOR THE 1ST HALF AND IF YOU GET THE DESIRED VALUE IT
WIL NOT SCAN THE SECOND PART WHICH HENANCES PERFORMANCE
TUNING....

Is BAdI client Indpendent

1 Answers   SAP Labs,

---

What are the different functions used in sap script?

0 Answers  

---

Is the basic list deleted when the new list is created?

0 Answers  

---

How are the date abd time field values stored in sap?

0 Answers  

---

differnce between user and customer exit

2 Answers  

---

how to create a button in selection screen? how to add a gui status in a selection screen?

2 Answers   Wipro,

---

Give few names of transparent tables ?

1 Answers  

---

Explain what is step-loop?

0 Answers  

---

What are the different abap/4 editors?

0 Answers  

---

What are clustered tables?

0 Answers  

---

What are the basic objects of the data dictionary? : abap data dictionary

0 Answers  

---

where u can u set the pages in script (don't say first page, remaining pages i want)?

1 Answers   Intelligroup,

---