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

what is the variable to be used in sap scripts to find the total number of pages of the print job?

1 Answers  

---

what is the difference between se16 and se17 ??? need urgent ans plz..

5 Answers  

---

Can we debug RFC's? If yes how can we do?

1 Answers  

---

How do you retrieve the data for repetitive structures

2 Answers  

---

Can you transport variants of multiple programs in one step?

1 Answers  

---

---

What are hashed tables?

0 Answers   Infosys,

---

What are the mandatory fields to be filled in Transaction VA21 for 'Creation of sales order Quotation'.

1 Answers   SGT,

---

how to Implemented a BAPI to upload Payroll summary information into SAP R/3 system

1 Answers  

---

What work you have done in HR module

0 Answers   Infosys,

---

How to debug a sapscript?

0 Answers  

---

How to put a TableControl in a Screen of Modulepool Programming?

1 Answers  

---

how can we print both side in smartforms?

2 Answers   CTS,

---