binary search if of order log n where as sequential search is of order n

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 / srikanth

Answer Posted / srikanth

binary search if of order log n where as sequential search
is of order n
binary search is faster..

Is This Answer Correct ?

36 Yes

2 No

Please Help Members By Posting Answers For Below Questions

What are the advantages of bubble sort?

1030

Is array size dynamic or fixed?

1010

Why do we use trees in data structures?

948

Which collection allows null values?

936

Write code for reversing a linked list.

1007

What is data and data types?

974

Explain multiply linked list in short.

958

Difference between hashset and treeset?

1107

Is hashmap a collection?

943

What is the space complexity of quicksort?

956

Mention the data structures which are used in graph implementation.

927

Have you ever used HashTable and Directory?

1014

What is mean by abstract data type?

1057

Define data type and what are the types of data type?

946

Define disjoint set adt?

990