title: Find algorithm to split sequence in 2 to minimize difference in sum
body: <p>Here's the problem: given a sequence of numbers, split these numbers into 2 sequences, so that the difference between the two sequences is the minimum. For example, given the sequence: [5, 4, 3, 3, 3] the solution is:<br>
  [5, 4]      -> sum is 9<br>
  [3, 3, 3]   -> sum is 9<br>
  The difference is 0</p>
  
  <p>In other terms, can you find an algorithm (C language preferred) that given an input vector (variable size) of integers, can output two vector where the difference between the two sum is minimum?<br>
  Brutal force algorithm should be avoided.</p>
  
  <p>To be sure to get the right solution, should be nice to compare in a benchmark the results between your algorithm and a brutal force algorithm.</p>