title: Finding out the minimum difference between elements in an array
body: <p>I have an integer array with some finite number of values. My job is to find the minimum difference between any two elements in the array.</p>
  
  <p>Consider that the array contains </p>
  
  <pre><code>4, 9, 1, 32, 13
  </code></pre>
  
  <p>Here the difference is minimum between 4 and 1 and so answer is 3.</p>
  
  <p>What should be the algorithm to approach this problem. Also, I don't know why but I feel that using trees, this problem can be solved relatively easier. Can that be done?</p>