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

Can you sort a hashmap?

How many null values are allowed in hashmap?

How many different trees are possible with 10 nodes ?

Tell me can the size of operator be used to tell the size of an array passed to a function?

What will happen if an array goes out of bounds?

What is pointer in data structure?

Is bucket sort a comparison sort?

Does list maintain insertion order?

What package is arraylist?

Explain extended binary tree.

What is data type explain?

What do you mean by Logical Error

For more Data Structures Interview Questions Click Here