title: Split an array of integers into 3 number blocks with equal sum
body: <p>Don't know if I phrased it good, but I'll try to explain it further here:</p>
  
  <p>So, I have an array of numbers, let's say <code>1 2 3 4 5 6 7 8 9 10 11 14</code> and I need to write an algorithm to split up the array into 3 number sized array with equal sums, which in this case would be:</p>
  
  <p><code>{14,2,4} {11,6,3} {10,1,9} {5,7,8}</code> - i think i got it.</p>
  
  <p>So, what I have now in my head is:</p>
  
  <p>Checking every possible sum of the integers, and putting three indexes used and the sum into a structure.  </p>
  
  <p>Then, with an array of structures, I would sort them by sum and would search for <code>N/3</code> number of sums, and if found, I print out the numbers according to their indexes.  </p>
  
  <p>The algorithm includes running through all numbers a lot of times, so it would be very slow. Can anyone suggest a better algorithm? If someone would like to give pieces of code, I can program in <code>C</code> and i have started learning <code>Java</code>.</p>
  
  <p>Thank you!</p>