DATA STRUCTURE
Programming and Technical
Programming
Technical
Which one is faster? A binary search of an orderd set of
elements in an array or a sequential search of the
elements.
Read Solution (Total 8)
-
- binary search is faster
since binary search complexity is long n(follows divide and conquer)
sequential search complexity is n. - 10 years agoHelpfull: Yes(8) No(0)
- Binary search!
- 10 years agoHelpfull: Yes(3) No(0)
- binary search its complexity is logn as compared to sequential search n
- 10 years agoHelpfull: Yes(0) No(0)
- binary search
- 10 years agoHelpfull: Yes(0) No(0)
- binary search
- 10 years agoHelpfull: Yes(0) No(0)
- binary search is faster
- 9 years agoHelpfull: Yes(0) No(0)
- BINARY SEARCH
- 9 years agoHelpfull: Yes(0) No(0)
- binary search
- 9 years agoHelpfull: Yes(0) No(0)
DATA STRUCTURE Other Question