Algorithms For Carito

Day 2.js

// x = [1,5,7,4]
// return [5,6,4]
function pop(x) {
  var n = [];
  for (var i = 0; i < x.length -1; i++) {
    n[i] = x[i+1];
  }
  
  return n
}

console.log(pop([1,5,7,4])) // => [5,6,4]



// x = [1,5,7,4]
// n = 6
// return [6,1,5,6,4]
function push(x,n) {
  for (var i = x.length-1; i >= 0; i--) {
    x[i+1] = x[i];
  }
  
  x[0] = n
  
  return x
}
console.log(push([1,5,7,4],6)) // =>[6,1,5,6,4]