Give an algorithm for the following problem and determine its time complexity. 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 maximized. You may assume that n is a multiple of 2 (i.e. n is even).

1 Answers  

---

I want to prepare for PSU's bt i dont know how many PSU's are open for computer science students and what is the competition level for these. So if anybody knows this please guide me through this.

0 Answers  

---

Why viruses wont affect Linux systems?

1 Answers  

---

What is Campus selection process of patni at Adcet,Ashta at 24th dec 2010.Also give apti syllabus.

0 Answers   Patni,

---

what is memory interface????

1 Answers   TCS,

---

---

Define configuration and calibration and explain with an example

0 Answers  

---

how to delete four out of five duplicate records in a table using sql

0 Answers  

---

difference between tcp ip and open system interconnection

0 Answers  

---

How to freely move a ball in graphics mode.

0 Answers   Impetus,

---

Tell me about urself? asked me qstns on my resume what about higher studies any plans? where do u find urself after 3-4

0 Answers  

---

What are the differences between 1 dimensional RAM and 2 dimensional RAM?

0 Answers  

---

An inversion is an array of numbers is any pair (i,j) such that i<j and A[i]>A[j]. What is the average number of inversions in an array of n ? distinct numbers?

2 Answers   Infosys,

---