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
- 22381 Views
- IBM, I also Faced
- E-Mail Answers
Answer Posted / saksham 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 algorithm ,it
will fail for the search.
| Is This Answer Correct ? | 17 Yes | 0 No |
Post New Answer View All Answers
What are the Various Types of internal tables?
What are the steps in a bdc session? : abap bdc
Can you create a table with fields not referring to data elements? : abap data dictionary
What is web dynpro for abap?
What are the two ways for restricting the value range for a domain ?
Differentiate between ooabap and abap?
What are conversion & interface programs in sap?
What are the two levels in defining a match code? : abap data dictionary
What is the difference between bdc_okcode and bdc_cursor? : abap bdc
How to Solve a Particular Ticket in Realtime ?
Search help exit details.
On which even we can validate the input fields in module progams?
What is the significance of the screen number ‘0’?
What is step-loop? Explain all the steps?
What is SAP Data conversion ?
