Interested to Buy Any Domain ? << Click Here >> for more details...
Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.
- 22 Answers
- 47335 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / srikanth
binary search if of order log n where as sequential search
is of order n
binary search is faster..
| Is This Answer Correct ? | 36 Yes | 2 No |
Post New Answer View All Answers
Does treeset remove duplicates?
Differentiate between iterator and enumeration.
Define graph traversals?
How does a selection sort work for an array?
Explain the expression trees?
What is the difference between null and void?
Which is faster hashmap or hashset?
Different Types of pattern?
Mention for which header list, you will found the last node contains the null pointer?
Describe queue operation.
What does each entry in the link list called?
What are linked lists used for?
What is difference between while and do while?
What is a data structure? What are the types of data structures? Briefly explain them
How does hashset maintain order?
