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.


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

Post New Answer

More AI Algorithms Interview Questions

Which language is used for artificial intelligence?

0 Answers   Flextronics,


Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,


What is simulated annealing algorithm?

0 Answers  


What is greedy best first search algorithm?

0 Answers  


Name search algorithm technology?

0 Answers  






Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.

0 Answers   Amazon,


What are the disadvantages of depth-first search algorithm?

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  


Which algorithm inverts a complete resolution strategy?

0 Answers  


How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?

0 Answers  


Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,


Categories