Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More AI Algorithms Interview Questions

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

0 Answers   Twitter,


What do you mean by overfitting and underfitting algorithms?

0 Answers  


What is local search algorithms?

0 Answers  


Why size of integer depends on the machine architecture then what the best sorting algorithm and why?

0 Answers   HPCL, Hughes Systique Corporation,


What is iterative deepening depth-first search algorithm?

0 Answers  






What is depth-first search algorithm?

0 Answers  


What is simulated annealing algorithm?

0 Answers  


What are the disadvantages of depth-first search algorithm?

0 Answers  


What is breath-first search algorithm?

0 Answers  


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,


what is software cycle?give a diagramatic representation

0 Answers  


What is informed (heuristic) search strategies algorithm?

0 Answers  


Categories