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 the bucket size, when the overlapping and collision occur at the same time?

How to excel in data structures and algorithms?

Explain how to find 3rd element from end in a linked list in one pass?

What is map data structure?

What is binary tree?

What is data structure in programming language?

What is a treemap chart?

What is the prerequisite for binary searching?

Is pointer a variable in data structure?

Is list an array?

State the difference between primitive and non-primitive data types?

When will we get ArrayStoreException?

For more Data Structures Interview Questions Click Here