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
- 46130 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 do you mean by sorting?
What's difference between stack and queue?
What is a sorting algorithm in data structure?
Is array static or dynamic?
If I try to add enum constants to a treeset, what sorting order will it use?
When should structures be passed by values or by reference?
Which sorting algorithm is the slowest?
What is dynamic array how it is created?
Define a relation?
What data type is enum?
which is the simplest file structure? (Sequential, indexed, random)
Why null is allowed in hashmap?
Is arraylist a list?
Write a program to reverse a link list.
Describe tree database.
