Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
993A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
DELL,
1234Given 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).
954Given 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.
1242Why size of integer depends on the machine architecture then what the best sorting algorithm and why?
986Post New AI Algorithms Questions
1. Consider the following algorithm: for ( i = 1 ; i <= 1 . 5 n ; i++) cout << i ; for ( i = n ; i >= 1 ; i - - ) cout << i ; (a) What is the output when n = 2, n = 4, and n = 6? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.
Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?
What is the iterative deepening depth-first search algorithm?
Give a general algorithm for converting a m-array tree to a 2-ary tree.
Sorting algorithms and time complexity of various algorithms.
Tell us how will you know which machine learning algorithm to choose for your classification problem?
What is meant by uniform cost search algorithm?
Name search algorithm technology?
What is depth-first search algorithm?
Explain the Canny's Algorithm.
What is iterative deepening depth-first search algorithm?
What is the uniform cost search algorithm?
Which algorithm inverts a complete resolution strategy?
What is the depth-first search algorithm?
Which is the most straight forward approach for planning algorithms?