Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
743A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
DELL,
972Given a series of positive integers. Design an efficient algorithm that can detect pairs whose sum is equal to K such that K = ei + ej, and (i not equal to j).
685Given 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.
785Why size of integer depends on the machine architecture then what the best sorting algorithm and why?
728Post New AI Algorithms Questions
What is simulated annealing algorithm?
What are disadvantages uniform cost search algorithm?
What do you mean by overfitting and underfitting algorithms?
Which language is used for artificial intelligence?
What is greedy best first search algorithm?
What are the disadvantages of breadth-first search algorithm?
What is meant by a * search algorithm?
What is meant by uniform cost search algorithm?
Which search algorithm will use a limited amount of memory in an online search?
Which search algorithm will use a limited amount of memory in online search?
When an algorithm is considered completed?
what is software cycle?give a diagramatic representation
Which algorithm inverts a complete resolution strategy?
Consider the following algorithm, where the array A is indexed 1 through n: int add_them ( int n , int A[ ] ) { index i , j , k ; j = 0 ; for ( i = 1 ; i <= n ; i++) j = j + A[i] ; k = 1 ; for ( i = 1 ; i <= n ; i++) k = k + k ; return j + k ; } (a) If n = 5 and the array A contains 2, 5, 3, 7, and 8, what is returned? (b) What is the time complexity T(n) of the algorithm?
Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?
