Give an algorithm for the following problem. Given a list of n distinct positive

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.

Question Posted / john

0 Answers
2690 Views
I also Faced
E-Mail Answers

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

Post New Answer

More AI Algorithms Interview Questions

What is Na?ve Bayes Algorithm?

2 Answers

what is software cycle?give a diagramatic representation

0 Answers

There are numbers from 1 to n, which are inverted such that it results in numbers from n to 1. If only two consecutive numbers are stampled at a time and are inverted, how many moves are required?

1 Answers IBM, TCS,

list the types of linked list with aid of diagram?

0 Answers

What is the depth-first search algorithm?

0 Answers

Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.

0 Answers

What is the most efficient way to store 1 million phone numbers memory-wise?

0 Answers Aspire, Infogain,

What is Back propagation in Neural Networks?

1 Answers

What are disadvantages uniform cost search algorithm?

0 Answers

Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?

0 Answers

A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.

0 Answers DELL,

Write a code/algorithm to find the frequency of each element in an array?

0 Answers ITC Indian Tobacco Company,

For more AI Algorithms Interview Questions Click Here