Before using BINARY SEARCH with READ TABLE the table must be sorted in ascending order according to the specified key and in the sequence in which the key fields occur.
Binary search will divide the entries in internal table in to two halves and it will compare the record to be searched with the middle item.If it matches then it will read that entry else it will check whether the search key is less than or greater than that of the middle item.
Then it repeats this algorithm in the respective half till the record with respective search key is found.
Binary search will divide the entries in internal table in to two halves and it will compare the record to be searched with the middle item.If it matches then it will read that entry else it will check whether the search key is less than or greater than that of the middle item.
Then it repeats this algorithm in the respective half till the record with respective search key is found.