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 is garbage collection in data structure?

892

Explain recursive function & what is the data structures used to perform recursion?

980

Which is better selection or bubble sort?

819

What are the 3 control structures in programming?

872

What is a Breadth First Search? Give a few of its applications.

837

Can you declare an array without assigning the size of an array?

1012

What is the difference between file structure and storage structure?

947

What is meant by deque?

856

What do you mean by union-by-weight?

941

Name few classes that implement collection interface?

858

How do you declare An array of three pointers to chars

818

What is the difference between a Stack and a Queue.

901

What is the complexity of bubble sort?

904

Differentiate between priorityqueue and treeset.

1174

What are the tasks performed during postorder traversal?

886