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
- 46006 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / angu
Binary Search is efficent and faster because in Binary
search we search in systematic way which helps to fetch the
data easy. where as in Sequential search we have to come
across tll the nodes to get the desired data.
| Is This Answer Correct ? | 5 Yes | 4 No |
Post New Answer View All Answers
What is the difference between array list and vector list?
Why do we use hashmap?
State the demerits of linked representation of binary trees?
What is the default capacity of hashmap?
What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?
Why do we use data structures?
What is time complexity of arrays sort?
Does arraylist have index?
What does the term sorting refer to?
What is a binary search tree? Explain with example?
Explain what is the data structures used to perform recursion?
What do you mean by recursive definition?
Is int a data structure?
What is data structure explain different types of data structures with examples?
Can we declare array size as a negative number?
