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
What are the issues that hamper the efficiency in sorting a file?
What is difference between map and hashmap?
Define degree of the node?
What is data structure geeksforgeeks?
Can arraylist contain null?
What happens if we put duplicate key in hashmap?
Which language is best to learn data structures?
How can we reverse the order in the treemap?
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 ].
How does a heap sort work?
Define path in a graph?
What are lists?
What is best time complexity?
Explain binary searching, Fibonacci search.
Can a class have a constructor?