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  

---

can oracle driver be directly connected with odbc driver??

0 Answers  

---

which is better php,asp.net,jsp? and why?

0 Answers  

---

what is the best thing in engineering?

1 Answers   Vastu Vihar,

---

What are the different types of testing? What is SDLC? Manual of automated?How to choose among these two?

0 Answers   Sinertel,

---

What is the Boundary value analysis and Equlance class partition for select * from emp

0 Answers   Syntel,

---

how to send request to the direct server rather than proxy server

0 Answers  

---

How to access control's information on the another page.without using state management techniqe like cookies,session,viewstate,application state.

0 Answers  

---

Name a accredited or govt approved university which have 100% online engineering course

0 Answers  

---

give me some knowledge about automation on which asked on interview

0 Answers  

---

Write a nonrecursive routine to reverse a singly linked list in O(N) time.

4 Answers   Aptech, College School Exams Tests, IIIT, Infosys, KL University, SRM,

---

What is the purpose of dampening roller

0 Answers  

---