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

Sort the given values using Quick Sort? 65 70 75 80 85 60 55 50 45

What is time complexity of sorting algorithms?

What is the purpose of sorting algorithms?

List the applications of set adt?

Are lists mutable?

What is the default capacity of hashmap?

How to excel in data structures and algorithms?

What is data structure definition?

What is a minimum spanning tree?

Can we add elements to final list?

What is the quickest sorting algorithm?

What is the best case for bubble sort?

For more Data Structures Interview Questions Click Here