Interested to Buy Any Domain ? << Click Here >> for more details...
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.
- 0 Answers
- 2691 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Tell us why is naïve bayes machine learning algorithm naïve?
What is greedy best first search algorithm?
What was deep learning, & how does it contrast with other machine learning algorithms?
What is iterative deepening depth-first search algorithm?
What is simulated annealing algorithm?
What is Na?ve Bayes Algorithm?
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.
A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
What is breadth-first search algorithm?
Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
Write the Shortest path algorithm for a graph.
What are the disadvantages of breadth-first search algorithm?
-
AI Algorithms (74) - AI Natural Language Processing (96)
- AI Knowledge Representation Reasoning (12)
- AI Robotics (183)
- AI Computer Vision (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)
- AI Deep Learning (111)
- Generative AI (153)
- AI Frameworks Libraries (197)
- AI Ethics Safety (100)
- AI Applications (427)
- AI General (197)
- AI AllOther (6)
