title: Algorithm for finding change in progression of two sets of arrays
body: <p>I'm looking for an algorithm that will search for a change in the progression of two sets of numbers with the same length. The set starts at the same number all the time. For example:</p>
  
  <pre><code>Assumptions:
  1. Arrays 1 and 2 are the same length
  2. Progressions are not available at the start, and need to be computed. But computing it will be expensive with resources.
  
  Array 1 [1, 3, 5, 7, 10]
  Progression: +2, +2, +2, +3
  
  Array 2 [1, 2, 4, 6, 5]
  Progression: +1, +2, +2, -1
  
  Result: Array or numbers deviates on first progression by -1 and last progression by -4.
  </code></pre>
  
  <p>Is there a way to do this without resorting to any sort of linear search? </p>