Given a sorted array of n integers that has been rotated i(unknown) number of times, give a (log n) algorithm that finds an element in the array.


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

Post New Answer

More AI Algorithms Interview Questions

Tell us how will you know which machine learning algorithm to choose for your classification problem?

0 Answers  


What is the breadth-first search algorithm?

0 Answers  


What are the disadvantages of depth-first search algorithm?

0 Answers  


What is the iterative deepening depth-first search algorithm?

0 Answers  


Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,






Which search algorithm will use a limited amount of memory in an online search?

0 Answers  


What is the bidirectional search algorithm?

0 Answers  


Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.

0 Answers   Aspiring Minds,


list the types of linked list with aid of diagram?

0 Answers  


What is meant by a * search algorithm?

0 Answers  


What is the uniform cost search algorithm?

0 Answers  


What is depth-first search algorithm?

0 Answers  


Categories