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

In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none

Is binary tree balanced?

Check if duplicates exist in an array of N which has range 1 to N.

Which is faster arraylist or hashmap?

What is the best case complexity of bubble sort?

How many times is merge sort called?

How to copy an array into another array?

How do you reference all the elements in a one-dimension array?

Why is arraylist faster than linkedlist?

Define heap order property?

What is sorting rule in shapes?

What is difference between list set and map?

For more Data Structures Interview Questions Click Here