what is the difference b/w linear search and binary search?
(how can these search)
- 15 Answers
- 59960 Views
- HCL, IBM, I also Faced
- E-Mail Answers
Answer Posted / prabhjot singh
1.linear search is easy bt takes more time to search an
element as it compare all element sequentially...
2.elements r arranged randomly.
1. in binary search it start searching from middle, if the
searching element is not found in middle then it goes to
1/4,and vice versa..
and hence take less time than linear search.
2.elements r arranged in sorted orrder.
| Is This Answer Correct ? | 32 Yes | 9 No |
Post New Answer View All Answers
what are Hana Basics
What are the value tables?
What are th control break events in abap?
Explain the client concept of sap.
What are the data types of the external layer?
What are the main events of which are used for logical database?
A subroutine can contain nested form and endform blocks. State true or false. : abap modularization
What is the advantage of structures?
What are Table control and tab strip control in dialog programming ?
What is the difference between call transaction and session method? : abap bdc
What is the difference between getting and get late?
Why do we use events and actions in web dynpro?
What are the various types of selection screen event?
What are the problems in processing batch input sessions? How is batch inputprocess different from processing online?
How can cluster table be created?
