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


Please Help Members By Posting Answers For Below Questions

What is foreign key relationship? : abap hr

615


How to create a link between modified form and modified print program?

583


visibility section for class level and attributes level

815


How can you manipulate the presentation and attributes of interactive lists?

613


Which bdc you prefer? : abap bdc

712






What are the relational operations that can be performed on view in sap? : abap data dictionary

508


What are the screen painter and menu painter?

579


How to create any functions? How to go about it?

581


What is the use of the statement leave to list-processing?

585


Setting up a BDC program where you find information from?

657


How we format the data before before write statement in report ?

552


What is internal payroll process? : sap abap hr

586


What is your approach for writing a bdc program? : abap bdc

588


Explain the difference between tables and structures?

479


What is ole?

684