Write an algorithm that takes an array and moves all of the zeros to the end, preserving the order of the other elements.

moveZeros.js

/**
  Write an algorithm that takes an array and moves all of the zeros to the end, preserving the order of the other elements.
  
  e.g. 
  moveZeros([false,1,0,1,2,0,1,3,"a"]) // returns[false,1,1,2,1,3,"a",0,0]
**/

function moveZeros(arr) {
  //code me
}

/**
Test cases
assert.deepEqual(moveZeros([1,2,0,1,0,1,0,3,0,1]), [1, 2, 1, 1, 3, 1, 0, 0, 0, 0]);
assert.deepEqual(moveZeros([false,1,0,1,2,0,1,3,"a"]), [false,1,1,2,1,3,"a",0,0]);
assert.deepEqual(moveZeros([4,1,1,2,1,3,"a"]), [4,1,1,2,1,3,"a"]);
assert.deepEqual(moveZeros([1,0,0,1,0,1,0,3,0,1]), [1, 1, 1, 3, 1, 0, 0, 0, 0, 0]);
assert.deepEqual(moveZeros([0]), [0]);
assert.deepEqual(moveZeros([]), []);
**/

// Long way
function moveZeros(arr) {
  const result = arr;

  for (let i = 0; i < arr.length; i++) {
    shift();
  }

  function shift() {
    for (let i = 0; i < arr.length; i++) {
      if (result[i] === 0) {
        result.splice(i, 1);
        result.push(0);
        break;
      }
    }
  }
  return result;
}