title: How to divide a set into two subsets such that difference between the sum of numbers in two sets is minimal?
body: <blockquote>
    <p>Given a set of numbers, divide the numbers into two subsets such that difference between the sum of numbers in two subsets is minimal.</p>
  </blockquote>
  
  <p>This is the idea that I have, but I am not sure if this is a correct solution:</p>
  
  <ol>
  <li>Sort the array</li>
  <li>Take the first 2 elements. Consider them as 2 sets (each having 1 element)</li>
  <li>Take the next element from the array. </li>
  <li>Decide in which set should this element go (by computing the sum => it should be minimum)</li>
  <li>Repeat</li>
  </ol>
  
  <p>Is this the correct solution? Can we do better?</p>