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

Answer Posted / spandana

Binary search is faster

Is This Answer Correct ?    10 Yes 3 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What are the issues that hamper the efficiency in sorting a file?

592


What is difference between map and hashmap?

472


Define degree of the node?

562


What is data structure geeksforgeeks?

644


Can arraylist contain null?

468






What happens if we put duplicate key in hashmap?

496


Which language is best to learn data structures?

574


How can we reverse the order in the treemap?

486


an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].

564


How does a heap sort work?

468


Define path in a graph?

518


What are lists?

528


What is best time complexity?

463


Explain binary searching, Fibonacci search.

548


Can a class have a constructor?

512