Interested to Buy Any Domain ? << Click Here >> for more details...
Can we use binary search in internal table sorted in decending
order ? if no why?
- 3 Answers
- 22226 Views
- IBM, I also Faced
- E-Mail Answers
Answer Posted / sunil kumar gautam
Binary search algorithm is based on middle value , first
data is divided into two part on the basis of middle value
so that left side data is less than middle value and right
side data greater than middle value. Search value is equal
to middle value then it give result middle value. If search
value is greater than middle value it will be search right
side of middle value ,if search value is less than middle
value it will search left side. So Data should be ascending
order so that greater value will be right side of middle
value and lesser value will be left side of middle value.
For example 1,2,3,4,5,6,7,8,9 here middle value is 5.Now we
search 7 it will be search in right part from 5.It is give
result. It’s opposite if it is in descending order
9,8,7,6,5,4,3,2,1.Here 5 is middle value and 7 is searched
in right from 5 according to binary search principle ,it
will fail for the search.
| Is This Answer Correct ? | 36 Yes | 0 No |
Post New Answer View All Answers
What are the events in screen programming?
In order to upload purchase order details, how you handle multiple values for a single field?
Where can you find error log for call transaction? : abap bdc
What are the list of screen elements?
What does the extract statement do in extract datasets?
How to display or know if the value entered contains records or not?
Explain what is the purpose of sap script?
What is the difference between a dialog program and a report?
What is native sql?
What is the purpose of at first and at last?
Name some data dictionary objects?
What does nw 7.4 sp 05/nw 7.5 sp 02 offers in abap?
Have you printed any report?
What is the difference between a structure and a table? : abap data dictionary
What is the use of at new statement ?
