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

Which collection class is thread safe?

What is list and its types?

What are the four characteristics of algorithms?

What is sort order?

What is array sort?

Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)

Explain the types of linked lists.

Devise a program to sort an array using bubble sort.

What is collections singletonmap?

Why do we need linked list?

Define ancestor and descendant ?

What are the different types of linked list?

For more Data Structures Interview Questions Click Here