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 need for path compression?

Explain what is linear search?

where do you use double linked list?

Name some applications which use linked lists.

How null key is handled in hashmap?

What will be the output of below code?

What does arrays tostring do?

What is difference between array and string?

What is non linear structure?

Will this code give error if I try to add two heterogeneous elements in the arraylist? And why?

Which is faster array or list?

What is the need for extendible hashing?

For more Data Structures Interview Questions Click Here