binary search is faster than linear search.

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

Answer Posted / akbar

Is This Answer Correct ?

3 Yes

0 No

Please Help Members By Posting Answers For Below Questions

Which sorting algorithm is worst?

943

What is the difference between Array and Arraylist?

1144

What are the difference between malloc() and calloc()?

1069

What is difference between hashset and treeset?

1112

How do you sort pseudocode?

929

What is application of data structure?

942

How many sorting are there in data structure?

923

How is heap sort implemented?

887

What actions are performed when a function is called?

1029

We know that Arrays are objects so why cannot we write strArray.length()?

1658

What does the dummy header in the linked list contain?

1202

Can hashset contain null?

1083

What is queue example?

956

What is perfect binary tree?

892

What is a graph?

2115