Which one is faster? A binary search of an orderd set of elements in an array

Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.

Question Posted / guest

Answers were Sorted based on User's Feedback

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / ankita roy

sequential search of the elementss

Is This Answer Correct ?

0 Yes

1 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / amit patra

A sequential search of the elements.

Is This Answer Correct ?

0 Yes

2 No

More Data Structures Interview Questions

What is perfect binary tree?

Is list same as array?

What does isempty() member method determines?

What is the difference between set and unordered_set?

What is the prerequisite for binary searching?

What is collections singletonlist?

How is heap sort implemented?

What is the difference between 1d and 2d array?

What is difference between hashmap and arraylist?

What are the advantages and disadvantages of linked list?

How do stacks work?

Write the advantage of separate chaining?

For more Data Structures Interview Questions Click Here