Which is faster binary or linear search?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Data Structures Interview Questions

ple.. briefly describe the purpose of having a base case and a recursive case in a recursive algorithm

2 Answers  


How do you implement a stack?

0 Answers  


Can we use ordered set for performing binary search?

0 Answers  


What is a hashers run?

0 Answers  


What is the complexity of adding an element to the heap?

0 Answers  


What is a matrix? Explain its uses with an example

0 Answers  


Does linked list allow null values?

0 Answers  


Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).

0 Answers  


What is a b+ tree? Explain its uses.

0 Answers  


How would you use bsearch() function to search a name stored in array of pointers to string?

0 Answers  


How to check array contains value or not?

0 Answers  


Differentiate between iterable and iterator.

0 Answers  


Categories