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

what are the minimum requirements for statr testing?

0 Answers   QA,


What are disadvantages uniform cost search algorithm?

0 Answers  


Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?

0 Answers  


can anyone help me with some suggestions and improvemnts for sage line 50?

0 Answers  


What is software cycle? Give a diagrammatic representation?

0 Answers  






Can you pick an algorithm. Write the psuedo-code for a parallel implementation?

0 Answers  


Consider the following algorithm: j = 1 ; while ( j <= n/2) { i = 1 ; while ( i <= j ) { cout << j << i ; i++; } j++; } (a) What is the output when n = 6, n = 8, and n = 10? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

1 Answers  


What is the bidirectional search algorithm?

0 Answers  


What is simulated annealing algorithm?

0 Answers  


Explain the concept behind dead lock avoidance, banker's algorithm.

0 Answers   HPCL, Hughes Systique Corporation,


What’s your favorite algorithm, & can you explain it into me in less than a minute?

0 Answers  


Which language is used for artificial intelligence?

0 Answers   Flextronics,


Categories