Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.
Answer Posted / uma sankar reddy.p
Binarysearch is faster than sequential search
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Which interface treemap implements?
Write the stack overflow condition.
Explain heapsort. What is its complexity?
Are dictionaries mutable?
What is rule regarding overriding equals and hascode method?
Mention a few applications of linked lists?
List some applications of tree-data structure?
How does variable declaration affect memory allocation?
Why is data structure important?
Can we add elements to final list?
What are the applications of priority queues?
Which is faster list or set?
What is a data structure? What are the types of data structures? Briefly explain them
How do I start preparing for placement?
Explain what is linear search?