Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.
- 0 Answers
- 596 Views
- Aspiring Minds, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Given 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).
What do you mean by overfitting and underfitting algorithms?
Can you list some use cases where classification machine learning algorithms can be used?
What is iterative deepening depth-first search algorithm?
Explain the Canny's Algorithm.
Can you pick an algorithm. Write the psuedo-code for a parallel implementation?
How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?
Tell me how do you choose an algorithm for a classification problem?
What are the disadvantages of depth-first search algorithm?
what is software cycle?give a diagramatic representation
Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.
Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.
-
AI Algorithms (74) - AI Language Processing (96)
- AI Knowledge Representation (12)
- AI Robotics (183)
- AI Recognition (13)
- AI Neural Networks (66)
- AI Fuzzy Logic (31)
- AI Games (8)
- AI Languages (141)
- AI Tools (11)
- AI Machine Learning (659)
- Data Science (671)
- Data Mining (120)
- TensorFlow (197)
- AI Deep Learning (111)
- AI General (197)
- AI AllOther (6)
