title: Euclidean distance between np arrays
body: <p>I have two numpy arrays a and b: </p>
  
  <p>a and b are the same dimensions, a could be a different size than b. </p>
  
  <p>For instance: </p>
  
  <pre><code>a = [[1,2], ..., [5,7]]
  b = [ [3,8], [4,7], ... [9,15] ] 
  </code></pre>
  
  <p>Is there an easy way to compute the Euclidean distance between a and b such that this new array could be used in a k nearest neighbors learning algo.</p>
  
  <p>Note: This is in python  </p>