Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.

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

Post New Answer

More Data Structures Interview Questions

Who created quicksort?

0 Answers  


List some applications of tree-data structure?

0 Answers  


Why is quicksort faster than merge sort?

0 Answers  


What are linear and non linear data structures?

0 Answers  


Why is hashmap not thread safe?

0 Answers  






What is the difference between 1d and 2d array?

0 Answers  


What do you mean by external sorting?

0 Answers  


How do you sort large data?

0 Answers  


Why do we need to use computers to help us sort lists?

0 Answers  


What stack means?

0 Answers  


What is a tech stack?

0 Answers  


If you are given a choice to use either arraylist and linkedlist, which one would you use and why?

0 Answers  


Categories