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.

0 Answers   Expedia,

---

Explain the Canny's Algorithm.

0 Answers   Adobe,

---

Which language is used for artificial intelligence?

0 Answers   Flextronics,

---

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

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 are the disadvantages of breadth-first search algorithm?

0 Answers  

---

what is software cycle?give a diagramatic representation

0 Answers  

---

Which algorithm is used for solving temporal probabilistic reasoning?

0 Answers  

---

What features would you use to build a recommendation algorithm for users?

0 Answers   Twitter,

---

What are the complexities of sorting algorithms and how can this complexity be calculated?

0 Answers   Tech Mahindra,

---

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

0 Answers  

---

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

0 Answers  

---