what is a binary search ? and how it is useful in a sorted
internal table?
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
| Is This Answer Correct ? | 15 Yes | 0 No |
Post New Answer View All Answers
Explain the differences between sap memory and abap memory?
how 2 create the normal form by using functional module
Explain what are the events in screen programming?
What is sap script? Describe its components.
Can you define a field without a data element?
What is use of transparent table in abap? How it is different from pool tables?
What are logical data bases used in hr module? : abap hr
What is pretty printer?
When a program is created and need to be transported to prodn does selection texts always go with it? If not how do you make sure? Can you change the cts entries? How do you do it?
What is Transactional based Application & Role based Application?
What is buffering allowed but switched off?
What is sequence of event triggered in report?
What is a variable in the sap abap?
Explain the advantages and disadvantages of different types of bdc's?
Which bdc you prefer? : abap bdc