Answer Posted / parvendra
this algorithm is used to work on large databases
| Is This Answer Correct ? | 2 Yes | 3 No |
Post New Answer View All Answers
Which algorithm inverts a complete resolution strategy?
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.
What is meant by uniform cost search algorithm?
Which search algorithm will use a limited amount of memory in online search?
Tell me how do you choose an algorithm for a classification problem?
can anyone help me with some suggestions and improvemnts for sage line 50?
Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?
Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.
What features would you use to build a recommendation algorithm for users?
What are disadvantages uniform cost search algorithm?
What is meant by a * search algorithm?
Can you pick an algorithm. Write the psuedo-code for a parallel implementation?
When an algorithm is considered completed?
List the different algorithm techniques in machine learning?
What’s your favorite algorithm, & can you explain it into me in less than a minute?
