Given an array of sorted numbers, find the first 2 values that equal zero

bigOExamples--sumZero.js

/* Inefficient example would be a nested loop -- O(n^2)
** Below version uses multiple pointers to achieve O(n) 
*/
function sumZero(arr) {
  let left = 0;
  let right = arr.length - 1;

  while(left < right) {
    let sum = arr[left] + arr[right]

    if (sum === 0) {
      return [arr[left], arr[right]]
    } else if (sum > 0) {
      right --
    } else {
      left++
    }
  }
}

sumZero([-4, -3, -2, -1, 0, 1, 2, 3, 10])