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....

Difference between sy-tabix and sy-index? Where it is used? Can you check sy-subarc after perform?

0 Answers  

---

How to handle error in session method? : abap bdc

0 Answers  

---

Hi Experts, we have coded in smartforms also but why we r going to driver program for smartforms..

3 Answers   IBM,

---

What is buffering in abap?

0 Answers  

---

What are the dynapro keywords?

0 Answers  

---

---

What are V1 & V2 updates within the SAP LUW? Why & How they occur?

1 Answers  

---

we can write the select query or any code after the end of selection

2 Answers   TCS,

---

Name a few system global variables you can use in ABAP programs?

1 Answers  

---

Which configuration we have to make first before we want to start Business Workflow with our SAP R/3

1 Answers  

---

What is the use of the raising exception?

0 Answers  

---

Events that can be used in both the classical and interactive reports

0 Answers  

---

what is inline documnetation?

1 Answers  

---