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
- 46759 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
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
What is a 2 dimensional array?
What is sorting and its types?
List the abstract operations in the set?
Define collision in hashing?
How many types of linked lists are there?
Why linked list is required?
What are different techniques for making hash function?
If you are given a choice to use either arraylist and linkedlist, which one would you use and why?
Advanced problems related to Data Structures were asked
How do you access the values within an array?
What do you mean by the term “percolate down”?
Define leaves?
How do you implement a stack?
What is immutablelist?
What is the difference between the hash table and hash map?
